New lower bounds for the triplanar assignment problem. Use of the classical model

DOI10.1134/S0005117908120047zbMath1156.90414MaRDI QIDQ1003082

S. I. Sergeev

Publication date: 26 February 2009

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Discrete location and assignment (90B80)

Related Items (3)

Multiindex transportation problems with 2-embedded structure ⋮ Multi-index transport problems with decomposition structure ⋮ A heuristic method for solving integer-valued decompositional multiindex problems

Cites Work

• A restricted Lagrangean approach to the traveling salesman problem
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• Letter to the Editor—The Multidimensional Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New lower bounds for the triplanar assignment problem. Use of the classical model