A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem-Reference-Cited by-同舟云学术

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Published:2000-11 Issue:4 Volume:25 Page:645-656
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Kenyon Claire,Rémila Eric

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.25.4.645.12118

Reference18 articles.

1. Amoura A. K. , Bampis E. , Kenyon C. , Manoussakis Y. Scheduling multiprocessor tasks on dedicated processors.Proc. 5th Ann. Eur. Sympos. (ESA'97)(1997) Graz, Austria 1 12 . LNCS 1284

2. A algorithm for two-dimensional packing

3. Orthogonal Packings in Two Dimensions

4. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

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

1. Interpretability of rectangle packing solutions with Monte Carlo tree search;Journal of Heuristics;2024-03-18

2. Peak Demand Minimization via Sliced Strip Packing;Algorithmica;2023-07-27

3. A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing;Algorithmica;2023-05-10

4. An improved approximation algorithm for scheduling monotonic moldable tasks;European Journal of Operational Research;2023-04

5. A DYNAMIC PACKING APPROACH FOR INTERNET-OF-THINGS AND LOGISTICS APPLICATIONS;Turkic World Mathematical Society (TWMS) Journal of Pure and Applied Mathematics;2023