Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem

DOI10.1002/nav.3800270104zbMath0432.90060OpenAlexW1976764133MaRDI QIDQ3870675

Hanif D. Sherali, Mokhtar S. Bazaraa

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270104

zbMATH Keywords

quadratic assignment problemcomputational experience0-1 linear integer programmingBenders' partitioning schemereduction of degreetransformation of quadratic objective functions

Mathematics Subject Classification ID

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

Related Items

Flow distance reduction for a multi-product flowline with sets of identical machines, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, The facility layout problem, A new exact algorithm for the solution of quadratic assignment problems, A survey for the quadratic assignment problem, Quadratic assignment problems, Optimal sequences in stochastic single machine shops, A heuristic procedure for the single-row facility layout problem, Store-wide space planning balancing Impulse and convenience, Global optimality conditions and optimization methods for quadratic assignment problems, Locational analysis, On the quadratic assignment problem, Single and multiple period layout models for automated manufacturing systems, An experimental study of variable depth search algorithms for the quadratic assignment problem, Simulated annealing for machine layout problems in the presence of zoning constraints, A distance assignment approach to the facility layout problem, Mixed-integer bilinear programming problems, A layout design heuristic employing the theory of fuzzy sets, RLT: A unified approach for discrete and continuous nonconvex optimization, A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, A hybrid heuristic for the facilities layout problem, A Benders decomposition approach to product location in carousel storage systems, A demand-shifting feasibility algorithm for Benders decomposition., A neural network approach to facility layout problems, Optimizing simulated annealing schedules with genetic programming, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, A greedy genetic algorithm for the quadratic assignment problem, Network-based formulations of the quadratic assignment problem, Lower bounds for nonlinear assignment problems using many body interactions, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, Mixed-integer quadratic programming, A variant of time minimizing assignment problem, Linear programming insights into solvable cases of the quadratic assignment problem, Efficient models for the facility layout problem, An exact algorithm for the general quadratic assignment problem, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation

Cites Work

• A pseudo primal-dual integer programming algorithm
• Unnamed Item