A Lagrangian relaxation algorithm for sparse quadratic assignment problems
From MaRDI portal
Publication:1904611
DOI10.1016/0167-6377(94)00061-AzbMath0836.90128OpenAlexW2034226536MaRDI QIDQ1904611
I. Z. Milis, Vangelis F. Magirou
Publication date: 7 January 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)00061-a
Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (6)
A survey for the quadratic assignment problem ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm ⋮ The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
Uses Software
Cites Work
- Unnamed Item
- Quadratic assignment problems
- QAPLIB-A quadratic assignment problem library
- A parallel branch and bound algorithm for the quadratic assignment problem
- An algorithm for the multiprocessor assignment problem
- The Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Allocating programs containing branches and loops within a multiple processor system
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- Validation of subgradient optimization
- A quadratic assignment problem without column constraints
- The traveling-salesman problem and minimum spanning trees: Part II
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: A Lagrangian relaxation algorithm for sparse quadratic assignment problems
