Theoretical and computational study of several linearisation techniques for binary quadratic problems
From MaRDI portal
Publication:2288865
DOI10.1007/s10479-018-3118-2zbMath1434.90115OpenAlexW2905423736WikidataQ128740839 ScholiaQ128740839MaRDI QIDQ2288865
Fabio Furini, Emiliano Traversi
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/18644
quadratic knapsack problemmax cut problemlinearisation techniquesbinary quadratic problemsquadratic stable set problem
Related Items
An introduction to stochastic bin packing-based server consolidation with conflicts, Fast, flexible, and exact minimum flow decompositions via ILP, Mathematical models and approximate solution approaches for the stochastic bin packing problem, BDD-based optimization for the quadratic stable set problem, Inductive linearization for binary quadratic programs with linear constraints, Shortest paths with exclusive-disjunction arc pairs conflicts, Compact linearization for binary quadratic problems subject to assignment constraints, \(t\)-linearization for the maximum diversity problem, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
Uses Software
Cites Work
- A new linearization technique for multi-quadratic 0-1 programming problems.
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- The quadratic knapsack problem -- a survey
- A linearization framework for unconstrained quadratic (0-1) problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A computational study on the quadratic knapsack problem with multiple constraints
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- An improved linearization strategy for zero-one quadratic programming problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Exact Solution of the Quadratic Knapsack Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Extended formulations in combinatorial optimization
- Unnamed Item
