One-dimensional relaxations and LP bounds for orthogonal packing-Reference-Cited by-同舟云学术

One-dimensional relaxations and LP bounds for orthogonal packing

Published:2009-11 Issue:6 Volume:16 Page:745-766
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:

Author:

Belov G.,Kartak V.,Rohling H.,Scheithauer G.

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2009.00713.x/fullpdf

Reference31 articles.

1. Branching rules revisited;Achterberg;Operations Research Letters,2005

2. A branch and bound algorithm for the strip packing problem;Alvarez-Valdes;OR Spectrum,2009

3. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem;Alves;Computers and Operations Research,2008

4. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem;Baldacci;European Journal of Operational Research,2007

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

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

1. The maximum diversity assortment selection problem;Mathematical Methods of Operations Research;2021-05-25

2. Exact solution techniques for two-dimensional cutting and packing;European Journal of Operational Research;2021-03

3. Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization;International Transactions in Operational Research;2019-06-03

4. The minimum raster set problem and its application to the d-dimensional orthogonal packing problem;European Journal of Operational Research;2018-11

5. Packing Rectangles into a Strip;Introduction to Cutting and Packing Optimization;2017-10-24