LP models for bin packing and cutting stock problems
From MaRDI portal
Publication:1847189
DOI10.1016/S0377-2217(02)00124-8zbMath1059.90095OpenAlexW2127087935MaRDI QIDQ1847189
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00124-8
Related Items
Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ A single machine scheduling problem with two-dimensional vector packing constraints ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Integer linear programming models for the skiving stock problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process ⋮ Bin packing and related problems: general arc-flow formulation with graph compression ⋮ Exactly solving packing problems with fragmentation ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ Exact algorithms for the bin packing problem with fragile objects ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Multi-objective temporal bin packing problem: an application in cloud computing ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ A study on load-balanced variants of the bin packing problem ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ The generalized assortment and best cutting stock length problems ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ On LP relaxations for the pattern minimization problem ⋮ An exact model for a slitting problem in the steel industry ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints ⋮ Numerical optimization method for packing regular convex polygons ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ Characterizing the optimality gap and the optimal packings for the bin packing problem ⋮ 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 ⋮ Recursive algorithm for the two‐dimensional cutting problem of punched strips ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Heuristics for packing semifluids ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Complementary column generation and bounding approaches for set partitioning formulations ⋮ Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking ⋮ A lexicographic pricer for the fractional bin packing problem ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ The one-dimensional cutting stock problem with due dates ⋮ Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups ⋮ Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors ⋮ Improved flow-based formulations for the skiving stock problem ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Friendly bin packing instances without integer round-up property ⋮ Generating optimal two-section cutting patterns for rectangular blanks ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ 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
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
