On lower bounds for a class of quadratic 0,1 programs

DOI10.1016/0167-6377(85)90025-2zbMath0587.90069OpenAlexW2038681403MaRDI QIDQ1072937

Weixuan Xu, Arjang A. Assad

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90025-2

zbMATH Keywords

quadratic assignmentlower boundsleveling algorithmquadratic 0-1 integer programquadratic minimum spanning tree

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Boolean programming (90C09)

Related Items

Lower bounds for the quadratic assignment problem ⋮ Some applications of nonnegative linear systems: Farkas strikes again ⋮ A survey for the quadratic assignment problem ⋮ A parallel depth first search branch and bound algorithm for the quadratic assignment problem ⋮ An effective genetic algorithm approach to the quadratic minimum spanning tree problem ⋮ Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality ⋮ Selected topics on assignment problems ⋮ The linearization problem of a binary quadratic problem and its applications ⋮ An optimal tree search method for the manufacturing systems cell formation problem ⋮ A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Linear programming insights into solvable cases of the quadratic assignment problem

Cites Work

• Quadratic assignment problems
• On the quadratic assignment problem
• The Quadratic Assignment Problem