Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
From MaRDI portal
Publication:1662642
DOI10.1016/J.DISOPT.2018.02.003zbMath1506.90219OpenAlexW2597346146WikidataQ130185247 ScholiaQ130185247MaRDI QIDQ1662642
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
Publication date: 20 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01426690/file/article.pdf
Related Items (8)
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Improved flow-based formulations for the skiving stock problem
Cites Work
- Efficient elementary and restricted non-elementary route pricing
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Column generation for extended formulations
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A dynamic programming method for single machine scheduling
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Exact algorithms for the two-dimensional guillotine knapsack
- The two-dimensional cutting stock problem revisited
- An improved typology of cutting and packing problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- Models and algorithms for three-stage two-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Polyhedral Characterization of Discrete Dynamic Programming
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Validation of subgradient optimization
- Multistage Cutting Stock Problems of Two and More Dimensions
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
