Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique
Authors:
- Artur Alves PessoaAPArtur Alves Pessoa
- Peter M. HahnPHPeter M. Hahn
- Monique GuignardMGMonique Guignard
- Yi-Rong ZhuYZYi-Rong Zhu
- 1 October 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 206 (1) , 54-63
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- The quadratic three-dimensional assignment problem: Exact and approximate solution methodsEuropean Journal of Operational Research, 2008
- A level-2 reformulation–linearization technique bound for the quadratic assignment problemEuropean Journal of Operational Research, 2007
- A survey for the quadratic assignment problemEuropean Journal of Operational Research, 2007
- Effective algorithm and heuristic for the generalized assignment problemEuropean Journal of Operational Research, 2004
- Best reduction of the quadratic semi-assignment problemDiscrete Applied Mathematics, 2001
- The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 2000
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming ApproachesJournal of the Operational Research Society, 1992
- An algorithm for the multiprocessor assignment problemOperations Research Letters, 1989
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957