The indefinite zero-one quadratic problem
From MaRDI portal
Publication:585083
DOI10.1016/0166-218X(84)90111-2zbMATH Open0524.90061OpenAlexW2090739911MaRDI QIDQ585083FDOQ585083
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
transformationcomputational resultsbranch and bound algorithmequivalent positive definite problemindefinite 0-1 quadratic programmingrandom test problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Quadratic knapsack problems
- Newton-type methods for unconstrained and linearly constrained optimization
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Scheduling to Minimize Interaction Cost
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Duality in Discrete Programming: II. The Quadratic Case
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
Cited In (28)
- Submodular function minimization and polarity
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- The unconstrained binary quadratic programming problem: a survey
- CON due-date determination and sequencing
- Spectral partitioning with multiple eigenvectors
- A solvable case of quadratic 0-1 programming
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Experiments in quadratic 0-1 programming
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Bounds for Random Binary Quadratic Programs
- Minimization of a quadratic pseudo-Boolean function
- An exact penalty function approach for nonlinear integer programming problems
- Provable randomized rounding for minimum-similarity diversification
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- On the number of local maxima in quadratic 0-1 programs
- On duality for Boolean programming
- A solvable class of quadratic 0-1 programming
- Models and methods of solution of quadratic integer programming problems
- A study of the quadratic semi-assignment polytope
- Mathematical Programming Models and Exact Algorithms
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- Linear programming for the \(0-1\) quadratic knapsack problem
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- Building an iterative heuristic solver for a quantum annealer
- Ranking in quadratic integer programming problems
This page was built for publication: The indefinite zero-one quadratic problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585083)
