The indefinite zero-one quadratic problem
From MaRDI portal
Publication:585083
DOI10.1016/0166-218X(84)90111-2zbMath0524.90061MaRDI QIDQ585083
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
transformation; computational results; branch and bound algorithm; equivalent positive definite problem; indefinite 0-1 quadratic programming; random test problems
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C09: Boolean programming
Related Items
An exact penalty function approach for nonlinear integer programming problems, On duality for Boolean programming, CON due-date determination and sequencing, A study of the quadratic semi-assignment polytope, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, A solvable case of quadratic 0-1 programming, Experiments in quadratic 0-1 programming, A solvable class of quadratic 0-1 programming, Linear programming for the \(0-1\) quadratic knapsack problem, Spectral partitioning with multiple eigenvectors, Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, Ranking in quadratic integer programming problems, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Minimization of a quadratic pseudo-Boolean function, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, On the number of local maxima in quadratic 0-1 programs, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1, Models and methods of solution of quadratic integer programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- Newton-type methods for unconstrained and linearly constrained optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Scheduling to Minimize Interaction Cost
- Duality in Discrete Programming: II. The Quadratic Case
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
