Title
Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms.
Abstract
•Integer programming model for the rectangle blanket problem.•An exact solution approach using branch-and-price.•A purely geometric approach for solving pricing subproblems.•Three heuristics to compute good solutions efficiently.•Assessments of the solution algorithms on challenging test problems.
Year
DOI
Venue
2019
10.1016/j.ejor.2019.02.004
European Journal of Operational Research
Keywords
Field
DocType
Integer programming,Branch-and-price,Computer vision,Cutting /Packing,Heuristics
Simulated annealing,Heuristic,Mathematical optimization,Blanket,Packing problems,Upper and lower bounds,Rectangle,Algorithm,Heuristics,Mathematics,Computation
Journal
Volume
Issue
ISSN
277
1
0377-2217
Citations 
PageRank 
References 
0
0.34
0
Authors
4
Name
Order
Citations
PageRank
Baris Evrim Demiröz132.15
I. Kuban Altinel218013.18
lale akarun3120170.68
Altınel Kuban400.34