Pages that link to "Item:Q676776"
From MaRDI portal
The following pages link to Approximation algorithms for time constrained scheduling (Q676776):
Displayed 11 items.
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- The min-conflict packing problem (Q1761135) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- Approximation of a batch consolidation problem (Q3113503) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)