Complexity of uniqueness and local search in quadratic 0-1 programming
From MaRDI portal
Publication:1197889
DOI10.1016/0167-6377(92)90043-3zbMath0761.90070OpenAlexW1971496656MaRDI QIDQ1197889
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90043-3
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Analyzing the complexity of finding good neighborhood functions for local search algorithms, On equivalent reformulations for absolute value equations, On the complexity of approximating a KKT point of quadratic programming, Optimality Conditions for the Minimization of Quadratic 0-1 Problems, The unconstrained binary quadratic programming problem: a survey, Stability analysis in discrete optimization involving generalized addition operations, Testing optimality for quadratic 0?1 unconstrained problems, Adaptive randomization in network data, A quadratic simplex algorithm for primal optimization over zero-one polytopes, A column generation approach for the unconstrained binary quadratic programming problem, A QUBO formulation for the tree containment problem, Extremal values of global tolerances in combinatorial optimization with an additive objective function, Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming, Solving unconstrained binary quadratic programming problem by global equilibrium search, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Deciding uniqueness in norm maximazation, A new linearization technique for multi-quadratic 0-1 programming problems., Exact solution approach for a class of nonlinear bilevel knapsack problems, On complexity of unconstrained hyperbolic 0--1 programming problems, Lower bound improvement and forcing rule for quadratic binary programming, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM, An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm, Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
Cites Work
- Unnamed Item
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- NP is as easy as detecting unique solutions
- Checking local optimality in constrained quadratic programming is NP- hard
- How easy is local search?
- Recognition problems for special classes of polynomials in 0-1 variables
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Simple Local Search Problems that are Hard to Solve
- Methods of Nonlinear 0-1 Programming
- Construction of test problems in quadratic bivalent programming
