An algorithm for the quadratic assignment problem using Benders' decomposition
From MaRDI portal
Publication:1247369
DOI10.1016/0377-2217(78)90095-4zbMath0378.90065OpenAlexW2029983132MaRDI QIDQ1247369
Publication date: 1978
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(78)90095-4
Related Items
Facility layout problem with QAP formulation under scenario-based uncertainty, 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 quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem, A survey for the quadratic assignment problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence, Quadratic assignment problems, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, The Rank-One Quadratic Assignment Problem, Optimal sequences in stochastic single machine shops, A new exact discrete linear reformulation of the quadratic assignment problem, A heuristic procedure for the single-row facility layout problem, Store-wide space planning balancing Impulse and convenience, A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, The blocks relocation problem with item families minimizing the number of reshuffles, FACOPT: A user friendly FACility layout OPTimization system., On the quadratic assignment problem, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, A distance assignment approach to the facility layout problem, An improved linearization technique for a class of quadratic 0-1 programming problems, A set partitioning approach to shunting, New linearizations of quadratic assignment problems, Selected topics on assignment problems, A genetic algorithm for facility layout, Effective formulation reductions for the quadratic assignment problem, Exact procedures for solving the discrete ordered median 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, On solving a hard quadratic 3-dimensional assignment problem, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, A convex form of the quadratic assignment problem, GRASP with Path-Relinking for Facility Layout, On the Quadratic Programming Approach for Hub Location Problems, GRASP with path-relinking for the generalized quadratic assignment problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, A Set Partitioning Approach to Shunting, Network-based formulations of the quadratic assignment problem, One-dimensional machine location problems in a multi-product flowline with equidistant locations, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Linear programming insights into solvable cases of the quadratic assignment problem, Solving large single allocation \(p\)-hub problems with two or three hubs, Efficient models for the facility layout problem, Integer programming formulations of discrete hub location problems, An exact algorithm for the general quadratic assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- The Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- Multicommodity Distribution System Design by Benders Decomposition
- Numerical investigations on quadratic assignment problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Tree-search algorithms for quadratic assignment problems
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
