A near-optimal solution to a two-dimensional cutting stock problem

被引：138
|
作者：
Kenyon, C
Rémila, E
机构：
[1] Univ Paris Sud, LRI, F-91405 Orsay, France
[2] Univ St Etienne, IUT Roanne, Grima, F-42334 Roanne, France
[3] Ecole Normale Super Lyon, CNRS, Umr 5668, F-69364 Lyon, France
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2000年 / 25卷 / 04期
关键词：
cutting-stock; strip-packing; fully polynomial approximation scheme;
D O I：
10.1287/moor.25.4.645.12118
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing of n rectangles whose total height is within a factor of(1 + epsilon) of optimal (up to an additive term), and has running time polynomial both in n and in 1/epsilon.
引用
收藏
页码：645 / 656
页数：12
相关论文
共 50 条
  • [41] INNOVATIVE ACCESS TO SOLUTION "TWO-DIMENSIONAL" CUTTING PROBLEM IN METALLURGICAL OPERATIONS
    Lampa, Martin
    Janovska, Kamila
    Besta, Petr
    METAL 2013: 22ND INTERNATIONAL CONFERENCE ON METALLURGY AND MATERIALS, 2013, : 1971 - 1976
  • [42] A NEW HEURISTIC ALGORITHM FOR TWO-DIMENSIONAL DEFECTIVE STOCK GUILLOTINE CUTTING STOCK PROBLEM WITH MULTIPLE STOCK SIZES
    Jin, Maozhu
    Ge, Pen
    Ren, Peiyu
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2015, 22 (05): : 1107 - 1116
  • [43] Near-optimal worst-case throughput routing for two-dimensional mesh networks
    Seo, D
    Ali, A
    Lim, WT
    Rafique, N
    Thottethodi, M
    32ND INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, : 432 - 443
  • [44] Generalized belief propagation receiver for near-optimal detection of two-dimensional channels with memory
    Shental, O
    Weiss, AJ
    Shental, N
    Weiss, Y
    2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2004, : 225 - 229
  • [45] GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
    Alvarez-Valdes, Ramon
    Marti, Rafael
    Tamarit, Jose M.
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (02) : 261 - 272
  • [46] A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
    Furini, Fabio
    Malaguti, Enrico
    Duran, Rosa Medina
    Persiani, Alfredo
    Toth, Paolo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) : 251 - 260
  • [47] A Study of Ising Formulations for Minimizing Setup Cost in the Two-Dimensional Cutting Stock Problem
    Arai, Hiroshi
    Haraguchi, Harumi
    ALGORITHMS, 2021, 14 (06)
  • [48] GENERATING PALLET LOADING PATTERNS - SPECIAL CASE OF THE TWO-DIMENSIONAL CUTTING STOCK PROBLEM
    STEUDEL, HJ
    MANAGEMENT SCIENCE, 1979, 25 (10) : 997 - 1004
  • [49] The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches
    Douglas Nogueira do Nascimento
    Adriana Cristina Cherri
    José Fernando Oliveira
    Operational Research, 2022, 22 : 5363 - 5403
  • [50] Tree Search Reinforcement Learning for Two-Dimensional Cutting Stock Problem With Complex Constraints
    Shi, Fengyuan
    Meng, Ying
    Tang, Lixin
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2025, 22 : 6860 - 6875
12345