An exact algorithm for general, orthogonal, 2-dimensional knapsack problems

A new exact tree-search procedure is presented for solving 2-dimensional knapsack problems in which a number of small rectangular pieces, each of a given size and value, are required to be cut from a large rectangular stock plate. The objective is to maximize the value of pieces cut or minimize the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 1995-05, Vol.83 (1), p.39
Hauptverfasser:	Hadjiconstantinou, Eleni, Christofides, Nicos
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Hierarchies Integer programming Knapsack problem Operations research Optimization algorithms Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!