Theoretical and computational study of several linearisation techniques for binary quadratic problems
From MaRDI portal
Publication:2288865
Recommendations
- The linearization problem of a binary quadratic problem and its applications
- Compact linearization for binary quadratic problems
- On linearization techniques for budget-constrained binary quadratic programming problems
- An improved linearization technique for a class of quadratic 0-1 programming problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Quadratic reformulations of nonlinear binary optimization problems
- A quadratically convergent method for linear programming
- A continuous approach to binary quadratic problems
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
Cites work
- A computational study on the quadratic knapsack problem with multiple constraints
- A linearization framework for unconstrained quadratic (0-1) problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An improved linearization strategy for zero-one quadratic programming problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Exact Solution of the Quadratic Knapsack Problem
- Extended formulations in combinatorial optimization
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- L’algebre de Boole et ses applications en recherche operationnelle
- Quadratic binary programming models in computational biology
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The quadratic knapsack problem -- a survey
Cited in
(17)- On linearization techniques for budget-constrained binary quadratic programming problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- The linearization problem of a binary quadratic problem and its applications
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Fast, flexible, and exact minimum flow decompositions via ILP
- t-linearization for the maximum diversity problem
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- BDD-based optimization for the quadratic stable set problem
- scientific article; zbMATH DE number 3970525 (Why is no real title available?)
- Inductive linearization for binary quadratic programs with linear constraints
- Shortest paths with exclusive-disjunction arc pairs conflicts
- New advances for quantum-inspired optimization
- On the benefits of a new continuous reformulation for QUBO problems
- A novel dynamic programming heuristic for the quadratic knapsack problem
- A continuous nonlinear optimization perspective on the spin glass problem
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
This page was built for publication: Theoretical and computational study of several linearisation techniques for binary quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288865)
