Constrained 0-1 quadratic programming: basic approaches and extensions
From MaRDI portal
Publication:2467302
Recommendations
- A polyhedral approach for a constrained quadratic 0-1 problem
- scientific article; zbMATH DE number 1500161
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Quadratic convex reformulations for quadratic 0-1 programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Convex quadratic programming with one constraint and bounded variables
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- scientific article; zbMATH DE number 57066
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714531 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A Heuristic Method for the Set Covering Problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact Solution of the Quadratic Knapsack Problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Quadratic knapsack problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The cut polytope and the Boolean quadric polytope
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- The traveling-salesman problem and minimum spanning trees: Part II
- Upper bounds and exact algorithms for \(p\)-dispersion problems
Cited in
(21)- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- The quadratic shortest path problem: complexity, approximability, and solution methods
- A multilevel analysis of the Lasserre hierarchy
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Extending the QCR method to general mixed-integer programs
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
- New formulations of the multiple sequence alignment problem
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
This page was built for publication: Constrained 0-1 quadratic programming: basic approaches and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467302)
