The three-dimensional assignment and partition problems. New lower bounds
From MaRDI portal
Publication:2457504
Recommendations
Cites work
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3616187 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 1100443 (Why is no real title available?)
- scientific article; zbMATH DE number 1450261 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- 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
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Letter to the Editor—The Multidimensional Assignment Problem
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- The set covering problem: Complexity, algorithms, experiments
Cited in
(6)- Lower bounds for the axial three-index assignment problem
- 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
- 3-partitioning problems for maximizing the minimum load
- New lower bounds for the triplanar assignment problem. Use of the classical model
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
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)
