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

DOI10.1134/S0965542507060127MaRDI QIDQ5438151zbMATH OpenOpenAlexFDO

Authors 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 experimentsapproximate algorithmsmulticriteria optimizationasymptotically ideal solutionplanar assignment problem

Mathematics Subject Classification ID

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

Recommendations

• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
• Asymptotic approach to the solution of a multicriterion three-index planar problem of choice
• scientific article; zbMATH DE number 1894378
• Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.

Cited in

(11)

• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Decomposition method for solving a three-index planar assignment problem
• Remark on the paper ``A polynomial algorithm for the multi-index choice problem
• Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.
• Asymptotic approach to the solution of a multicriterion three-index planar problem of choice
• scientific article; zbMATH DE number 4156199 (Why is no real title available?)
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
• Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
• A polynomial algorithm for the multi-index decision problem
• Decomposition method for solving the three-index problem of effective shooting
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438151)