Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem

DOI10.1134/S0965542507060127zbMath1292.90161OpenAlexW1990476279MaRDI QIDQ5438151

S. A. Dichkovskaya, M. K. Kravtsov

Publication date: 22 January 2008

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542507060127

zbMATH Keywords

computational experimentsmulticriteria optimizationapproximate algorithmsasymptotically ideal solutionplanar assignment problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (1)

Efficient algorithms for three‐dimensional axial and planar random assignment problems

This page was built for publication: Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem