Inductive linearization for binary quadratic programs with linear constraints

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A new linearization technique for multi-quadratic 0-1 programming problems.
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
Experiments in quadratic 0-1 programming
On the quadratic assignment problem
Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
Linear programming for the \(0-1\) quadratic knapsack problem
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
A semidefinite programming approach to the quadratic knapsack problem
Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
Compact linearization for binary quadratic problems subject to assignment constraints
The cut polytope and the Boolean quadric polytope
Theoretical and computational study of several linearisation techniques for binary quadratic problems
The symmetric quadratic traveling salesman problem
An improved linearization strategy for zero-one quadratic programming problems
Compact linearization for binary quadratic problems
Assignment Problems and the Location of Economic Activities
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
L’algebre de Boole et ses applications en recherche operationnelle
A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Reducibility among Combinatorial Problems
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Some Network Flow Problems Solved with Pseudo-Boolean Programming
Solution of a Large-Scale Traveling-Salesman Problem
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
Best reduction of the quadratic semi-assignment problem