The indefinite zero-one quadratic problem

DOI10.1016/0166-218X(84)90111-2MaRDI QIDQ585083zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3216613 (Why is no real title available?)
• scientific article; zbMATH DE number 3335677 (Why is no real title available?)
• scientific article; zbMATH DE number 3353076 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• scientific article; zbMATH DE number 3422199 (Why is no real title available?)
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Duality in Discrete Programming: II. The Quadratic Case
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
• Newton-type methods for unconstrained and linearly constrained optimization
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Quadratic knapsack problems
• Scheduling to Minimize Interaction Cost
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

Cited in

(28)

• Submodular function minimization and polarity
• Mathematical programming models and exact algorithms
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• 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
• Experiments in quadratic 0-1 programming
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
• 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
• Linear programming for the \(0-1\) quadratic knapsack problem
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• Bounds for random binary quadratic programs
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Building an iterative heuristic solver for a quantum annealer
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
• 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)