Local search heuristics for multi-index assignment problems with decomposable costs
From MaRDI portal
Publication:4661195
DOI10.1057/palgrave.jors.2601723zbMath1095.90066OpenAlexW2051390209MaRDI QIDQ4661195
A. J. T. Maas, Frits C. R. Spieksma, Hans-Jürgen Bandelt
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601723
Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Related Items (5)
Efficient sensor network management for asset localization ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Local search heuristics for the multidimensional assignment problem ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
This page was built for publication: Local search heuristics for multi-index assignment problems with decomposable costs
