LP models for bin packing and cutting stock problems
From MaRDI portal
Publication:1847189
DOI10.1016/S0377-2217(02)00124-8zbMath1059.90095MaRDI QIDQ1847189
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Recursive algorithm for the two‐dimensional cutting problem of punched strips, The layout problem of two kinds of graph elements with performance constraints and its optimality conditions, On compact formulations for integer programs solved by column generation, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, Complementary column generation and bounding approaches for set partitioning formulations, 0-1 reformulations of the multicommodity capacitated network design problem, An effective solution for a real cutting stock problem in manufacturing plastic rolls, The one-dimensional cutting stock problem with due dates, A cutting stock problem and its solution in the manufacturing industry of large electric generators, A combined approach to the solution to the general one-dimensional cutting stock problem, Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Generating optimal two-section cutting patterns for rectangular blanks, Accelerating column generation for variable sized bin-packing problems, One-dimensional relaxations and LP bounds for orthogonal packing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A time indexed formulation of non-preemptive single machine scheduling problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving binary cutting stock problems by column generation and branch- and-bound
- An exact algorithm for IP column generation
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A typology of cutting and packing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Mathematical Methods of Organizing and Planning Production
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A New Linear Programming Approach to the Cutting Stock Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems
