Inductive linearization for binary quadratic programs with linear constraints
From MaRDI portal
Recommendations
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Linear Reformulations of Integer Quadratic Programs
- On linearization techniques for budget-constrained binary quadratic programming problems
- Compact linearization for binary quadratic problems
- Compact linearization for binary quadratic problems subject to assignment constraints
Cites work
- A linearization framework for unconstrained quadratic (0-1) problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A semidefinite programming approach to the quadratic knapsack problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An improved linearization strategy for zero-one quadratic programming problems
- Assignment Problems and the Location of Economic Activities
- Best reduction of the quadratic semi-assignment problem
- Compact linearization for binary quadratic problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Experiments in quadratic 0-1 programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3332070 (Why is no real title available?)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
- Linear programming for the \(0-1\) quadratic knapsack problem
- L’algebre de Boole et ses applications en recherche operationnelle
- On the quadratic assignment problem
- Reducibility among combinatorial problems
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Solution of a Large-Scale Traveling-Salesman Problem
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- 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 cut polytope and the Boolean quadric polytope
- The symmetric quadratic traveling salesman problem
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
Cited in
(5)- Compact linearization for binary quadratic problems subject to assignment constraints
- Efficient linear reformulations for binary polynomial optimization problems
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- Efficient separation of RLT cuts for implicit and explicit bilinear terms
This page was built for publication: Inductive linearization for binary quadratic programs with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057718)
