Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
From MaRDI portal
Publication:3870675
Cites work
Cited in
(37)- An exact algorithm for the general quadratic assignment problem
- The facility layout problem
- Locational analysis
- On the quadratic assignment problem
- Single and multiple period layout models for automated manufacturing systems
- Simulated annealing for machine layout problems in the presence of zoning constraints
- A distance assignment approach to the facility layout problem
- A neural network approach to facility layout problems
- Optimizing simulated annealing schedules with genetic programming
- Network-based formulations of the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- A variant of time minimizing assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- A heuristic procedure for the single-row facility layout problem
- A greedy genetic algorithm for the quadratic assignment problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A demand-shifting feasibility algorithm for Benders decomposition.
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- 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
- Optimal sequences in stochastic single machine shops
- A hybrid heuristic for the facilities layout problem
- A Benders decomposition approach to product location in carousel storage systems
- Linear programming insights into solvable cases of the quadratic assignment problem
- A layout design heuristic employing the theory of fuzzy sets
- Mixed-integer quadratic programming
- Global optimality conditions and optimization methods for quadratic assignment problems
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Quadratic assignment problems
- Store-wide space planning balancing Impulse and convenience
- Mixed-integer bilinear programming problems
- Efficient models for the facility layout problem
- A survey for the quadratic assignment problem
This page was built for publication: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870675)
