Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
DOI10.1007/S13675-019-00113-9zbMATH Open1431.90001OpenAlexW2804571018WikidataQ127896226 ScholiaQ127896226MaRDI QIDQ2294074FDOQ2294074
Authors: François Clautiaux, Ruslan Sadykov, F. Vanderbeck, Quentin Viaud 
Publication date: 10 February 2020
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-019-00113-9
Recommendations
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- An algorithm for the 2D guillotine cutting stock problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Discrete location and assignment (90B80)
Cites Work
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Multistage Cutting Stock Problems of Two and More Dimensions
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Exact solution of the two-dimensional finite bin packing problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Recent advances on two-dimensional bin packing problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- Models and algorithms for three-stage two-dimensional bin packing
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Evolutionary Computation in Combinatorial Optimization
- Exact algorithms for the two-dimensional guillotine knapsack
- Polyhedral Characterization of Discrete Dynamic Programming
- Modeling two-dimensional guillotine cutting problems via integer programming
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
Cited In (2)
This page was built for publication: Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294074)
