Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms-Reference-Cited by-同舟云学术

Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms

Published:2019-08 Issue:1 Volume:277 Page:62-83
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Demiröz Barış Evrim,Altınel İ. Kuban^ORCID,Akarun Lale

Funder

State Planning Organization

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference78 articles.

1. A branch & bound algorithm for cutting and packing irregularly shaped pieces;Alvarez-Valdes;International Journal of Production Economics,2013

2. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms;Babu;Computer Aided Design,2001

3. Algorithms for nesting with defects;Baldacci;Discrete Applied Mathematics,2014

4. Bounds for two-dimensional cutting;Beasley;Journal of the Operational Research Society,1985

5. An exact two-dimensional non-guillotine cutting tree search procedure;Beasley;Operations Research,1985

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the project scheduling problem with dependent resource constraints;Journal of Industrial and Production Engineering;2024-08-02

2. Shore hydrogen deployment problem in green ports;Computers & Operations Research;2024-05

3. The board packing problem;European Journal of Operational Research;2023-08