Pages that link to "Item:Q3710296"

The following pages link to The cutting stock problem and integer rounding (Q3710296):

Displaying 42 items.

• Continuous knapsack sets with divisible capacities (Q263180) (← links)
• A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← links)
• ATM VP-based network design (Q596263) (← links)
• Solving sequential knapsack problems (Q688211) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• On the bin packing problem with a fixed number of object weights (Q872247) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
• A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829) (← links)
• An instance of the cutting stock problem for which the rounding property does not hold (Q1080366) (← 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)
• Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
• On variations of the subset sum problem (Q1382248) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
• Tighter relaxations for the cutting stock problem (Q1806682) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Strong IP formulations need large coefficients (Q2019425) (← links)
• Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
• A rounding theorem for unique binary tomographic reconstruction (Q2274077) (← links)
• A well-solvable special case of the bounded knapsack problem (Q2275577) (← 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)
• L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
• An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• Column generation for a UAV assignment problem with precedence constraints (Q2903993) (← links)
• The Mixing Set with Divisible Capacities (Q3503864) (← links)
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
• Column-Generation in Integer Linear Programming (Q4450558) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)