Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Authors:
- Hans-Jürgen BandeltHBHans-Jürgen Bandelt
- Yves CramaYCYves Crama
- Frits C.R. SpieksmaFSFrits C.R. Spieksma
- 1 March 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 49 (1-3) , 25-50
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximation algorithms for three-dimensional assignment problems with triangle inequalitiesEuropean Journal of Operational Research, 1992
- Throughput rate optimization in the automated assembly of printed circuit boardsAnnals of Operations Research, 1990
- A class of bounded approximation algorithms for graph partitioningNetworks, 1990
- Facets of the three-index assignment polytopeDiscrete Applied Mathematics, 1989
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching PracticeJournal of the Operational Research Society, 1981
- A bilinear programming formulation of the 3-dimensional assignment problemMathematical Programming, 1974
- Letter to the Editor—The Multidimensional Assignment ProblemOperations Research, 1968
- The Multi-Index ProblemOperations Research, 1963