Problems, Models and Algorithms in One- and Two-Dimensional Cutting

Problems, Models and Algorithms in One- and Two-Dimensional Cutting

Within such disciplines as Management Science, Information and Computer Science, Engineering, Mathematics and Operations Research, problems of cutting and packing (C&P) of concrete and abstract objects appear under various specifications (cutting problems, knapsack problems, container an...

Full description

Bibliographic Details
Main Author: Belov, Gleb
Other Authors: Technische Universität Dresden, Mathematik und Naturwissenschaften, Mathematik, Numerische Mathematik
Format: Doctoral Thesis
Language:English
Published: Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden 2004
Subjects:
Zuschnitt
branch-and-bound
cutting
discrete optimization
packing
ddc:510
rvk:SK 890
Branch-and-Bound-Methode
Diskrete Optimierung
Packungsproblem
Zuschneideproblem
Online Access:http://nbn-resolving.de/urn:nbn:de:swb:14-1077284830765-13397
http://nbn-resolving.de/urn:nbn:de:swb:14-1077284830765-13397
http://www.qucosa.de/fileadmin/data/qucosa/documents/1111/1077284830765-1339.pdf

Internet

http://nbn-resolving.de/urn:nbn:de:swb:14-1077284830765-13397
http://nbn-resolving.de/urn:nbn:de:swb:14-1077284830765-13397
http://www.qucosa.de/fileadmin/data/qucosa/documents/1111/1077284830765-1339.pdf

Similar Items