Pages that link to "Item:Q1290661"
From MaRDI portal
The following pages link to Worst-case analyses, linear programming and the bin-packing problem (Q1290661):
Displaying 19 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- Scheduling multiple orders per job in a single machine to minimize total completion time (Q992578) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Product packing and stacking under uncertainty: a robust approach (Q1740542) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- A-shaped bin packing: Worst case analysis via simulation (Q2386612) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- The inventory packing problem (Q3826323) (← links)
- New worst-case results for the bin-packing problem (Q4290987) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
