4.4 Article

On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Interdisciplinary Applications

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing

Thiago A. de Queiroz et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for the two-dimensional guillotine knapsack

Mohammad Dolatabadi et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

Article Computer Science, Artificial Intelligence

Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape

Aline M. Del Valle et al.

EXPERT SYSTEMS WITH APPLICATIONS (2012)

Article Management

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

E. G. Birgin et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2012)

Article Operations Research & Management Science

An approximation scheme for the two-stage, two-dimensional knapsack problem

Alberto Caprara et al.

DISCRETE OPTIMIZATION (2010)

Article Computer Science, Information Systems

There is no EPTAS for two-dimensional knapsack

Ariel Kulik et al.

INFORMATION PROCESSING LETTERS (2010)

Article Management

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

E. G. Birgin et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2010)

Article Management

A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem

Roberto Baldacci et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Article Management

An exact algorithm for higher-dimensional orthogonal packing

Sandor P. Fekete et al.

OPERATIONS RESEARCH (2007)

Article Computer Science, Interdisciplinary Applications

Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem

V Pureza et al.

COMPUTERS & OPERATIONS RESEARCH (2006)

Article Computer Science, Interdisciplinary Applications

A branch-and-cut algorithm for the pallet loading problem

R Alvarez-Valdes et al.

COMPUTERS & OPERATIONS RESEARCH (2005)

Article Operations Research & Management Science

On the two-dimensional knapsack problem

A Caprara et al.

OPERATIONS RESEARCH LETTERS (2004)

Article Management

An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces

L Lins et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2003)