Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis

MaRDI QIDQ1589147zbMATH OpenFDO

Authors A. I. Serdyukov, Eh. Kh. Gimadi

Publication date 7 March 2001

Published in Russian Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited in

(3)

• Lower bounds for the axial three-index assignment problem
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• A heuristic method for solving integer-valued decompositional multiindex problems

This page was built for publication: Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis

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