Pages that link to "Item:Q453052"
From MaRDI portal
The following pages link to Approximating the multi-level bottleneck assignment problem (Q453052):
Displaying 6 items.
- 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)
- 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)