scholarly journals External buildings retrofit: Employing guillotine cuts for aesthetic envelopes

2016 ◽  
Author(s):  
A. F. Barco ◽  
M. Aldanondo ◽  
E. Vareilles ◽  
P. Gaborit
Keyword(s):  
Guillotine Cuts

scholarly journals Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts

Omega ◽  
2015 ◽  
Vol 52 ◽  
pp. 15-32 ◽  
Author(s):  
Antonio Martinez-Sykora ◽  
Ramon Alvarez-Valdes ◽  
Julia Bennell ◽  
Jose Manuel Tamarit
Keyword(s):  
Bin Packing ◽  
Packing Problems ◽  
Guillotine Cuts

scholarly journals Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

2002 ◽  
Vol 116 (3) ◽  
pp. 243-260 ◽  
Author(s):  
Aristide Mingozzi ◽  
Serena Morigi
Keyword(s):  
Maximum Cost ◽  
Guillotine Cuts

Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

2019 ◽  
Vol 27 (2) ◽  
pp. 767-793 ◽  
Author(s):  
Mateus Martin ◽  
Ernesto G. Birgin ◽  
Rafael D. Lobato ◽  
Reinaldo Morabito ◽  
Pedro Munari
Keyword(s):  
Two Dimensional ◽  
Placement Problem ◽  
Guillotine Cuts

scholarly journals An Exact Method for the 2D Guillotine Strip Packing Problem

2009 ◽  
Vol 2009 ◽  
pp. 1-20 ◽  
Author(s):  
Abdelghani Bekrar ◽  
Imed Kacem
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Valid Inequalities ◽  
Packing Problem ◽  
Strip Packing ◽  
Opposite Edge ◽  
Infinite Height ◽  
Test Algorithm ◽  
Feasibility Test ◽  
Guillotine Cuts

We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of widthWand infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one edge to the opposite edge (guillotine constraint). To solve this problem, we use a dichotomic algorithm that uses a lower bound, an upper bound, and a feasibility test algorithm. The lower bound is based on solving a linear program by introducing new valid inequalities. A new heuristic is used to compute the upper bound. Computational results show that the dichotomic algorithm, using the new bounds, gives good results compared to existing methods.

Sign in / Sign up

Export Citation Format

Share Document