A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
From MaRDI portal
Publication:1278325
DOI10.1016/0377-2217(95)00161-1zbMath0953.90544OpenAlexW2031385420MaRDI QIDQ1278325
Takao Enkawa, Yasutoshi Yajima, Abdolhamid Torki
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00161-1
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
The bipartite quadratic assignment problem and extensions ⋮ A survey for the quadratic assignment problem ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic assignment problems
- A distance assignment approach to the facility layout problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A hybrid heuristic for the facilities layout problem
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- An algorithm for nonconvex programming problems
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- P-Complete Approximation Problems
- A Successive Underestimation Method for Concave Minimization Problems
- Numerical investigations on quadratic assignment problems
- OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
- Scalar Invariants of a Rotational System in a Lie Algebra
