Lower bounds for nonlinear assignment problems using many body interactions
From MaRDI portal
Publication:1291723
DOI10.1016/S0377-2217(97)00038-6zbMath0957.90075OpenAlexW1997994705MaRDI QIDQ1291723
Bala Ramachandran, Joseph F. Pekny
Publication date: 22 March 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00038-6
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Discrete location and assignment (90B80) Decomposition methods (49M27)
Related Items
A survey for the quadratic assignment problem ⋮ Exact Solution of Two Location Problems via Branch-and-Bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel branch and bound algorithm for the quadratic assignment problem
- On the quadratic assignment problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- The Quadratic Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- A parallel shortest augmenting path algorithm for the assignment problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
