Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
From MaRDI portal
Publication:1025992
DOI10.1016/j.dam.2007.12.008zbMath1178.90251OpenAlexW2007500789MaRDI QIDQ1025992
Christophe Meyer, Pierre Hansen
Publication date: 23 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.12.008
Related Items
Mathematical Programming Models and Exact Algorithms, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Easy distributions for combinatorial optimization problems with probabilistic constraints, Inductive linearization for binary quadratic programs with linear constraints, A column generation approach for the unconstrained binary quadratic programming problem, Compact linearization for binary quadratic problems subject to assignment constraints, Quadratic reformulations of nonlinear binary optimization problems, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, A computational study on the quadratic knapsack problem with multiple constraints, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, Theoretical and computational study of several linearisation techniques for binary quadratic problems, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, Solving multistatic sonar location problems with mixed-integer programming, Lagrangean decompositions for the unconstrained binary quadratic programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An improved enumerative algorithm for solving quadratic zero-one programming
- Pseudo-Boolean optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Block linear majorants in quadratic 0--1 optimization
- ``Miniaturized linearizations for quadratic 0/1 problems
- Persistency in quadratic 0-1 optimization
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Minimization of a quadratic pseudo-Boolean function
- An efficient linearization approach for mixed-integer problems
- A linearization method for mixed 0--1 polynomial programs
- Seizure warning algorithm based on optimization and nonlinear dynamics
- A simple recipe for concise mixed 0-1 linearizations
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Compact linearization for binary quadratic problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Technical Note—Linearization in 0-1 Variables: A Clarification
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- L’algebre de Boole et ses applications en recherche operationnelle
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
