Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
From MaRDI portal
(Redirected from Publication:1662642)
Recommendations
- Exact algorithms for the two-dimensional guillotine knapsack
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
Cites work
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A dynamic programming method for single machine scheduling
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A near-optimal solution to a two-dimensional cutting stock problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An improved typology of cutting and packing problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Column generation for extended formulations
- Efficient elementary and restricted non-elementary route pricing
- Exact algorithms for the two-dimensional guillotine knapsack
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- Multistage Cutting Stock Problems of Two and More Dimensions
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Path-reduced costs for eliminating arcs in routing and scheduling
- Polyhedral Characterization of Discrete Dynamic Programming
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The two-dimensional cutting stock problem revisited
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- Validation of subgradient optimization
Cited in
(11)- Exact solution techniques for two-dimensional cutting and packing
- Improved flow-based formulations for the skiving stock problem
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- Solving a large cutting problem in the glass manufacturing industry
- Exact algorithms for the two-dimensional guillotine knapsack
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
This page was built for publication: Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662642)
