The three-dimensional assignment and partition problems. New lower bounds

DOI10.1134/S0005117906020044zbMath1126.90390MaRDI QIDQ2457504

S. I. Sergeev

Publication date: 23 October 2007

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

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching

Cites Work

• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• 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
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Letter to the Editor—The Multidimensional Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The three-dimensional assignment and partition problems. New lower bounds