An improved version of Wang's algorithm for two-dimensional cutting problems
From MaRDI portal
Publication:1825758
DOI10.1016/0377-2217(90)90361-EzbMath0684.90073OpenAlexW2042784190MaRDI QIDQ1825758
José Soeiro Ferreira, José Fernando Oliveira
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90361-e
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira, An interactive technique for the cutting stock problem with multiple objectives, Solving the pallet loading problem, An integrated cutting stock and sequencing problem, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, Exact solutions for constrained two-dimensional cutting problems, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, An EDA for the 2D knapsack problem with guillotine constraint, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, Exact algorithms for the guillotine strip cutting/packing problem., Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, An enumeration scheme to generate constrained exact checkerboard patterns, Packing problems, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Solution for the constrained Guillotine cutting problem by simulated annealing, A recursive exact algorithm for weighted two-dimensional cutting, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems, Strip based compact formulation for two-dimensional guillotine cutting problems, 2DPackLib: a two-dimensional cutting and packing library
Cites Work
- The trim-loss and assortment problems: A survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Performance testing of rectangular parts-nesting heuristics
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
