The three-dimensional assignment and partition problems. New lower bounds
From MaRDI portal
Publication:2457504
DOI10.1134/S0005117906020044zbMATH Open1126.90390MaRDI QIDQ2457504FDOQ2457504
Publication date: 23 October 2007
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
Cites Work
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- Title not available (Why is that?)
- Letter to the Editor—The Multidimensional Assignment Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Title not available (Why is that?)
- The set covering problem: Complexity, algorithms, experiments
- An Algorithm for the Three-Index Assignment Problem
- Title not available (Why is that?)
- A restricted Lagrangean approach to the traveling salesman problem
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- New lower bounds for the triplanar assignment problem. Use of the classical model
- Lower bounds for the axial three-index assignment problem
- 3-partitioning problems for maximizing the minimum load
- The three dimensional bottleneck assignment problem and its variants
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
This page was built for publication: The three-dimensional assignment and partition problems. New lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457504)
