Pages that link to "Item:Q2661503"
From MaRDI portal
The following pages link to On the extension complexity of scheduling polytopes (Q2661503):
Displaying 5 items.
- Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- The Complexity of Scheduling for p-Norms of Flow and Stretch (Q4910823) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)