Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems

An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine... http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computers & Operations Research CrossRef

An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems

Russo, Mauro; Sforza, Antonio; Sterle, Claudio
Computers & Operations Research , Volume 50: 97-114 – Oct 1, 2014
Download PDF

An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems

Russo, Mauro; Sforza, Antonio; Sterle, Claudio
Computers & Operations Research , Volume 50: 97-114 – Oct 1, 2014

Loading next page...
 
/lp/crossref/an-exact-dynamic-programming-algorithm-for-large-scale-unconstrained-vW2OzpAbA5

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
Copyright
Copyright © 2014 Elsevier Ltd. All rights reserved.
ISSN
0305-0548
DOI
10.1016/j.cor.2014.04.001
Publisher site
See Article on Publisher Site

Abstract

Journal

Computers & Operations Research – CrossRef

Published: Oct 1, 2014

References

  • Algorithms for unconstrained two-dimensional guillotine cutting
    Beasley
  • Generating unconstrained two-dimensional non guillotine cutting patterns by a recursive partitioning algorithm
    Birgin
  • An algorithm for two-dimensional cutting problems
    Christofides
  • Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
    Cintra
  • Exact and heuristic algorithms for staged cutting problems
    Cui
  • Constrained two-dimensional cutting stock problems. A best-first branch-and-bound algorithm
    Cung
  • Cutting and packing (C&P)
    Dyckhoff
  • PackLib2: an integrated library of multi-dimensional packing problems
    Fekete
  • Multistage cutting stock problems of two and more dimensions
    Gilmore
  • The theory and computation of knapsack functions
    Gilmore
  • Exact algorithms for large-scale unconstrained two and three staged cutting problems
    Hifi
  • A recursive computing procedure for two-dimensional stock cutting
    Herz
  • An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
    Kang
  • Two-dimensional packing problems: a survey
    Lodi
  • A comparative numerical analysis for the guillotine two-dimensional cutting problem
    Parada
  • An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem
    Russo
  • The G4-heuristic for the pallet loading problem
    Scheithauer
  • An improved typology of cutting and packing problems
    Wäscher
  • A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
    Young-Gun