Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
From MaRDI portal
Recommendations
- An improved linearization technique for a class of quadratic 0-1 programming problems
- A linearization framework for unconstrained quadratic (0-1) problems
- An improved linearization strategy for zero-one quadratic programming problems
- Compact linearization for binary quadratic problems
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- Improved approximation bound for quadratic optimization problems with orthogonality constraints
- scientific article; zbMATH DE number 1500161
Cites work
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3332070 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A linearization method for mixed 0--1 polynomial programs
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A simple recipe for concise mixed 0-1 linearizations
- An efficient linearization approach for mixed-integer problems
- An improved enumerative algorithm for solving quadratic zero-one programming
- Block linear majorants in quadratic 0--1 optimization
- Compact linearization for binary quadratic problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Minimization of a quadratic pseudo-Boolean function
- 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
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- Persistency in quadratic 0-1 optimization
- Pseudo-Boolean optimization
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Seizure warning algorithm based on optimization and nonlinear dynamics
- 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
- Technical Note—Linearization in 0-1 Variables: A Clarification
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- ``Miniaturized linearizations for quadratic 0/1 problems
Cited in
(24)- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Mathematical programming models and exact algorithms
- A column generation approach for the unconstrained binary quadratic programming problem
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Quadratic reformulations of nonlinear binary optimization problems
- A linearization framework for unconstrained quadratic (0-1) problems
- Solving multistatic sonar location problems with mixed-integer programming
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- A simple recipe for concise mixed 0-1 linearizations
- Reformulations in Mathematical Programming: Definitions and Systematics
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- Mixed integer linear programming formulation techniques
- Compact linearization for binary quadratic problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Tightening concise linear reformulations of 0-1 cubic programs
- A computational study on the quadratic knapsack problem with multiple constraints
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Inductive linearization for binary quadratic programs with linear constraints
- ``Miniaturized linearizations for quadratic 0/1 problems
This page was built for publication: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025992)
