Mixed-Integer and Constraint Programming Models for the Two-Dimensional Guillotine Cutting Problem

•Small oriented rectangles cut from a large rectangular plate via guillotine cuts.•Our modelling approach formulates the problem as a binary tree of guillotine cuts.•Our mixed-integer and constraint programming models solve the problem exactly.•Our constraint program benefits from cumulative schedul...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research
Hauptverfasser:	Polyakovskiy, Sergey, Dehghan, Milad, Mcgregor, Adam, Stuckey, Peter J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.10.2025
Schlagworte:	Constraint Programming Cutting and Packing Exact Approach Mixed-Integer Linear Programming Two-dimensional Knapsack Problem Cutting and Packing Constraint Programming Mixed-Integer Linear Programming Two-dimensional Knapsack Problem Exact Approach
ISSN:	0377-2217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!