Between a rock and a hard place: the two-to-one assignment problem
From MaRDI portal
Publication:1935948
Recommendations
- Between a rock and a hard place: the two-to-one assignment problem
- The approximability of three-dimensional assignment problems with bottleneck objective
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Two kinds of constrained assignment problems
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Analysis of a Compound Bin Packing Algorithm
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Geometric three-dimensional assignment problems
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Scheduling sports competitions on multiple venues.
- The approximability of three-dimensional assignment problems with bottleneck objective
- The hardness of approximation: Gap location
- Three-dimensional axial assignment problems with decomposable cost coefficients
Cited in
(4)
This page was built for publication: Between a rock and a hard place: the two-to-one assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935948)