Pages that link to "Item:Q1806682"
From MaRDI portal
The following pages link to Tighter relaxations for the cutting stock problem (Q1806682):
Displaying 22 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)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
- On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths (Q2884299) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap (Q4596192) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025) (← links)
