Pages that link to "Item:Q5901072"
From MaRDI portal
The following pages link to New hardness results for congestion minimization and machine scheduling (Q5901072):
Displayed 6 items.
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- Interval scheduling: A survey (Q3524590) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)