Pages that link to "Item:Q1751127"
From MaRDI portal
The following pages link to Geometric versions of the three-dimensional assignment problem under general norms (Q1751127):
Displaying 13 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- Coordinated lab-clinics: a tactical assignment problem in healthcare (Q1695040) (← links)
- Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- The three dimensional bottleneck assignment problem and its variants (Q3690581) (← links)
- Dynamic discrete tomography (Q4634750) (← links)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- On computing a center persistence diagram (Q6546596) (← links)
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem (Q6646031) (← links)