reine Buchbestellungen ab 5 Euro senden wir Ihnen Portofrei zuDiesen Artikel senden wir Ihnen ohne weiteren Aufpreis als PAKET

Nesting Problems: Exact and Heuristic Algorithms
(Englisch)
Antonio Martínez

Print on Demand - Dieser Artikel wird für Sie gedruckt!

54,45 €

inkl. MwSt. · Portofrei
Dieses Produkt wird für Sie gedruckt, Lieferzeit ca. 10 Werktage
Menge:

Nesting Problems: Exact and Heuristic Algorithms

Seiten
Erscheinungsdatum
Auflage
Ausstattung
Erscheinungsjahr
Sprache
Kategorie
Warengruppenindex
Warengruppe
Features
Laenge
Breite
Hoehe
Gewicht
Relevanz
Referenznummer
Verantwortlich für dieses Produkt
  • OmniScriptum GmbH & Co. KG
    Bahnhofstr. 28
    DE-66111 Saarbrücken
    +49 681 9100698
    info@akademikerverlag.de
Moluna-Artikelnummer
  • 5156591

Produktbeschreibung

Autor/Autorin: Martínez Antonio

Antonio Martinez studied Mathematics and Statistics at the University of Valencia. He has been researching in Cutting and Packing problems since 2009. In 2013 he finished his PhD developing exact and heuristics algorithms to solve 2D Cutting and Packing problems involving irregular pieces.
This book presents a new Mixed Integer Programming model for the 2-Dimensional Cutting and Packing problems involving irregular shapes. This model is used in order to develope a exact algorithm, a Branch and Cut algorithm, which is able to solve instances up to 16 pieces to optimality. On the other hand, there is proposed a Matheuristic algorithm which produce competitive results on problems with up to 99 pieces. Finally, we have developed a constructive procedure which produce the best known results in the 2-Dimensional Irregular Bin Packing problems with Guillotine Cuts.



Über den Autor

Antonio Martinez studied Mathematics and Statistics at the University of Valencia. He has been researching in Cutting and Packing problems since 2009. In 2013 he finished his PhD developing exact and heuristics algorithms to solve 2D Cutting and Packing problems involving irregular pieces.


Klappentext

This book presents a new Mixed Integer Programming model for the 2-Dimensional Cutting and Packing problems involving irregular shapes. This model is used in order to develope a exact algorithm, a Branch and Cut algorithm, which is able to solve instances up to 16 pieces to optimality. On the other hand, there is proposed a Matheuristic algorithm which produce competitive results on problems with up to 99 pieces. Finally, we have developed a constructive procedure which produce the best known results in the 2-Dimensional Irregular Bin Packing problems with Guillotine Cuts.



Datenschutz-Einstellungen