LP models for bin packing and cutting stock problems
From MaRDI portal
Recommendations
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An LP-based approach to a two-stage cutting stock problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- An LP-based approach to cutting stock problems with multiple objectives
- BPPLIB: a library for bin packing and cutting stock problems
- Models and complexity of multibin packing problems
- Solving bin packing problems using VRPSolver models
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem
- An inexact bundle approach to cutting-stock problems
- scientific article; zbMATH DE number 3932795
Cites work
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A time indexed formulation of non-preemptive single machine scheduling problems
- A typology of cutting and packing problems
- An exact algorithm for IP column generation
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- 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
- Branch-and-price: Column generation for solving huge integer programs
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Network flows. Theory, algorithms, and applications.
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Solving binary cutting stock problems by column generation and branch- and-bound
Cited in
(only showing first 100 items - show all)- 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 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
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- BPPLIB: a library for bin packing and cutting stock problems
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- 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
- 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
- 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
- Solving bin packing problems using VRPSolver models
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process
- 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
- An exact model for a slitting problem in the steel industry
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- Heuristics for packing semifluids
- A lexicographic pricer for the fractional bin packing problem
- Improved flow-based formulations for the skiving stock problem
- A branch-and-price algorithm for the temporal bin packing problem
- Friendly bin packing instances without integer round-up property
- A study on load-balanced variants of the bin packing problem
- Novel formulations and modeling enhancements for the dynamic berth allocation 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
- 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
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Online Bin Packing with (1,1) and (2,R) Bins
- Modeling two-dimensional guillotine cutting problems via integer programming
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- The generalized assortment and best cutting stock length problems
- On LP relaxations for the pattern minimization problem
- A single machine scheduling problem with two-dimensional vector packing constraints
- 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
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Skewed general variable neighborhood search for the location routing scheduling 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
- Solution approaches for the cutting stock problem with setup cost
- One-dimensional relaxations and LP bounds for orthogonal packing
- Bin packing and related problems: general arc-flow formulation with graph compression
- Exactly solving packing problems with fragmentation
- Lower and upper bounds for the bin packing problem with fragile objects
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- The proper relaxation and the proper gap of the skiving stock problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
- Numerical optimization method for packing regular convex polygons
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Deriving compact extended formulations via LP-based separation techniques
- Deriving compact extended formulations via LP-based separation techniques
- A combinatorial flow-based formulation for temporal bin packing problems
- 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 two-dimensional cutting stock problem within the roller blind production process
- A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items
- Cutting stock problem with usable leftovers: a review
- Weighted quantum genetic algorithm for one-dimensional bin packing problem
- Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
- A bay design problem in less-than-unit-load production warehouse
- Last fifty years of integer linear programming: a focus on recent practical advances
- Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
- Bin packing with thresholds: mathematical models and theoretical results
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Algorithms for the one-dimensional two-stage cutting stock problem
- Exact algorithms for energy-constrained scheduling on identical parallel machines
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
- Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
This page was built for publication: LP models for bin packing and cutting stock problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847189)
