Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles. We consider a variant of this problem, which arises in glass industry when different bills of order (or batches) are considered consecutively. For...
Saved in:
Main Authors: | François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2019
|
Subjects: | |
Online Access: | https://doaj.org/article/6537fed784134269ab6d6f6bb13a340e |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bilevel programming for price-based electricity auctions: a revenue-constrained case
by: Ricardo Fernández-Blanco, et al.
Published: (2015) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
by: Christian Artigues, et al.
Published: (2018) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
by: Thais Ávila, et al.
Published: (2017) -
An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
by: Martin Schmidt
Published: (2015) -
Matheuristics for optimizing the network in German wagonload traffic
by: Julia Sender, et al.
Published: (2017)