Pages that link to "Item:Q4419479"
From MaRDI portal
The following pages link to Interval selection: Applications, algorithms, and lower bounds (Q4419479):
Displayed 14 items.
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- Improving LTL truck load utilization on line (Q531465) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)