Compact linearization for binary quadratic problems subject to assignment constraints

Related Items

Inductive linearization for binary quadratic programs with linear constraints, A natural quadratic approach to the generalized graph layering problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A new linearization technique for multi-quadratic 0-1 programming problems.
Compact mathematical formulation for graph partitioning
A linearization framework for unconstrained quadratic (0-1) problems
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
On the quadratic assignment problem
Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
Theoretical and computational study of several linearisation techniques for binary quadratic problems
An improved linearization strategy for zero-one quadratic programming problems
Compact linearization for binary quadratic problems
Nonlinear 0–1 programming: I. Linearization techniques
Linear Reformulations of Integer Quadratic Programs
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
Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
P-Complete Approximation Problems
Computationally Related Problems
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
A polynomial case of unconstrained zero-one quadratic optimization