On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
From MaRDI portal
Publication:3962772
DOI10.2307/2581513zbMath0497.90042OpenAlexW4254745534MaRDI QIDQ3962772
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
quadratic assignment problemtest problemscutting planesheuristic algorithmoptimal solutioncomputational experiencesolution algorithmdisjunctive cutsintersection cutequivalent linear transformationreverse outer polar sets
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
An algebra-based approach for linearly constrained concave minimization, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, The facility layout problem, A survey for the quadratic assignment problem, Global minimization of large-scale constrained concave quadratic problems by separable programming, Global optimality conditions and optimization methods for quadratic assignment problems, A new necessary and sufficient global optimality condition for canonical DC problems, Continuation methods for approximate large scale object sequencing, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Generating quadratic assignment test problems with known optimal permutations, A branch and bound method for solving the bidirectional circular layout problem, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Heuristic methods and applications: A categorized survey, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Lower bounds for nonlinear assignment problems using many body interactions, On cutting planes for cardinality-constrained linear programs, A variant of time minimizing assignment problem
