Pages that link to "Item:Q1080366"
From MaRDI portal
The following pages link to An instance of the cutting stock problem for which the rounding property does not hold (Q1080366):
Displaying 30 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)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← 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)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- A rounding theorem for unique binary tomographic reconstruction (Q2274077) (← 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)
- Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
- Carathéodory bounds for integer cones (Q2480055) (← links)
- Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem (Q2487734) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
- Sensitive Instances of the Cutting Stock Problem (Q4965102) (← links)
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148) (← links)
- Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
