Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
From MaRDI portal
Publication:5139850
DOI10.1287/ijoc.2018.0880OpenAlexW2945097595WikidataQ127456604 ScholiaQ127456604MaRDI QIDQ5139850
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/1174547
Related Items (25)
A residual recombination heuristic for one-dimensional cutting stock problems ⋮ An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Bin Packing Problem with Time Lags ⋮ Half-cycle: a new formulation for modelling kidney exchange problems ⋮ The transportation problem with packing constraints ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ A generic exact solver for vehicle routing and related problems ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Exact solution of network flow models with strong relaxations ⋮ Tool switching problems with tool order constraints ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ Bin packing problem with conflicts and item fragmentation ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Solving bin packing problems using VRPSolver models ⋮ New exact techniques applied to a class of network flow formulations ⋮ Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Exactly solving packing problems with fragmentation
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Logic based Benders' decomposition for orthogonal stock cutting problems
- 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
- Variable neighbourhood search for the variable sized bin packing problem
- Tighter relaxations for the cutting stock problem
- LP models for bin packing and cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Friendly bin packing instances without integer round-up property
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Solving the variable size bin packing problem with discretized formulations
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Dual Inequalities for Stabilized Column Generation Revisited
- Using Extra Dual Cuts to Accelerate Column Generation
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
- Reformulation and Decomposition of Integer Programs
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- A New Linear Programming Approach to the Cutting Stock Problem
- The Bin Packing Problem with Precedence Constraints
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
This page was built for publication: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
