On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem

DOI10.2307/2581513zbMATH Open0497.90042OpenAlexW4254745534MaRDI QIDQ3962772FDOQ3962772

Authors: Hanif D. Sherali, Mokhtar S. Bazaraa 

Publication date: 1982

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581513

zbMATH Keywords

quadratic assignment problemcutting planesheuristic algorithmoptimal solutionsolution algorithmtest problemsdisjunctive cutscomputational experienceintersection cutequivalent linear transformationreverse outer polar sets

Mathematics Subject Classification ID

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

Cited In (18)

• A new necessary and sufficient global optimality condition for canonical DC problems
• A branch and bound method for solving the bidirectional circular layout problem
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global optimality conditions and optimization methods for quadratic assignment problems
• Heuristic methods and applications: A categorized survey
• A survey for the quadratic assignment problem
• Lower bounds for nonlinear assignment problems using many body interactions
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
• A variant of time minimizing assignment problem
• Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• The facility layout problem
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• On cutting planes for cardinality-constrained linear programs
• Generating quadratic assignment test problems with known optimal permutations
• Continuation methods for approximate large scale object sequencing
• An algebra-based approach for linearly constrained concave minimization

This page was built for publication: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962772)