The following pages link to (Q5685847):
Displaying 18 items.
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- Convergence of optimal stochastic bin packing (Q1062627) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- Effective methods for a container packing operation (Q1361222) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- Fast algorithms for bin packing (Q1845315) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
- Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers (Q2675699) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Relaxation techniques applied to some loading problems (Q4327925) (← links)
- Physical simulation of a three dimensional palletizing heuristic (Q4394260) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- The complexity of scheduling TV commercials (Q4923372) (← links)
- A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants (Q6060662) (← links)
