The cutting stock problem and integer rounding
From MaRDI portal
Publication:3710296
Recommendations
- Publication:4726042
- The modified integer round-up property of the one-dimensional cutting stock problem
- The cutting stock problem
- Integer rounding and modified integer rounding for the skiving stock problem
- A note on the approximability of cutting stock problems
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
Cites work
Cited in
(43)- Column generation for a UAV assignment problem with precedence constraints
- A rounding theorem for unique binary tomographic reconstruction
- Solving sequential knapsack problems
- Continuous knapsack sets with divisible capacities
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- Lifting for the integer knapsack cover polyhedron
- Large proper gaps in bin packing and dual bin packing problems
- An asymptotically exact algorithm for the high-multiplicity bin packing problem
- Knapsack polytopes: a survey
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes
- A polynomial-time algorithm for knapsack with divisible item sizes
- Strong IP formulations need large coefficients
- On variations of the subset sum problem
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- On the bin packing problem with a fixed number of object weights
- ATM VP-based network design
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- Column-Generation in Integer Linear Programming
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The modified integer round-up property of the one-dimensional cutting stock problem
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A new upper bound for the multiple knapsack problem
- A well-solvable special case of the bounded knapsack problem
- Large gaps in one-dimensional cutting stock problems
- Random search in the one-dimensional cutting stock problem
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- An instance of the cutting stock problem for which the rounding property does not hold
- On the effectivity of gradient methods for cutting stock problems
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- Knowledge based approach to the cutting stock problem
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
- Tighter relaxations for the cutting stock problem
- Optimal solutions for the cutting stock problem
- The Mixing Set with Divisible Capacities
- Relaxations and discretizations for the pooling problem
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
This page was built for publication: The cutting stock problem and integer rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3710296)
