Pages that link to "Item:Q1376328"
From MaRDI portal
The following pages link to Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328):
Displayed 15 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- Nested \((2,3)\)-instances of the cutting stock problem (Q6134054) (← links)