The following pages link to (Q4252288):
Displayed 9 items.
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Mixed-criticality scheduling on multiprocessors (Q2251396) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- Vector assignment schemes for asymmetric settings (Q2491210) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)