The indefinite zero-one quadratic problem

DOI10.1016/0166-218X(84)90111-2zbMath0524.90061OpenAlexW2090739911MaRDI QIDQ585083

Michael W. Carter

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90111-2

zbMATH Keywords

transformationcomputational resultsbranch and bound algorithmequivalent positive definite problemindefinite 0-1 quadratic programmingrandom test problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)

Related Items

A solvable case of quadratic 0-1 programming, On the number of local maxima in quadratic 0-1 programs, Provable randomized rounding for minimum-similarity diversification, Minimization of a quadratic pseudo-Boolean function, Mathematical Programming Models and Exact Algorithms, Building an iterative heuristic solver for a quantum annealer, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, Experiments in quadratic 0-1 programming, The unconstrained binary quadratic programming problem: a survey, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, CON due-date determination and sequencing, Bounds for Random Binary Quadratic Programs, 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 algorithm¹, Models and methods of solution of quadratic integer programming problems, A solvable class of quadratic 0-1 programming, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, An exact penalty function approach for nonlinear integer programming problems, A study of the quadratic semi-assignment polytope, On duality for Boolean programming, Linear programming for the \(0-1\) quadratic knapsack problem, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, 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, Submodular function minimization and polarity

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