Pages that link to "Item:Q453052"
From MaRDI portal
The following pages link to Approximating the multi-level bottleneck assignment problem (Q453052):
Displaying 14 items.
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
- Bottleneck assignment problems under categorization (Q1821678) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Multi-dimensional vector assignment problems (Q2339839) (← links)
- Task preference-based bottleneck assignment problem (Q2675766) (← links)
- (Q2762528) (← links)
- The Multicommodity Multilevel Bottleneck Assignment Problem (Q3439124) (← links)
- (Q3609235) (← links)
- Dynamic discrete tomography (Q4634750) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)