A POLYNOMIAL-TIME ALGORITHM FOR THE GUILLOTINE PALLET LOADING PROBLEM

被引：0
|
作者：
TARNOWSKI, AG
TERNO, J
SCHEITHAUER, G
机构：
来源：
INFOR | 1994年 / 32卷 / 04期
关键词：
CUTTING STOCK PROBLEM; DYNAMIC PROGRAMMING; MINIMIZATION OF LINEAR MODULO FUNCTION; PALLET LOADING PROBLEM;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A polynomial time algorithm is presented for solving the two-dimensional guillotine cutting stock problem where all small rectangles are of the same dimensions (generating pallet loading patterns). It is based on the initial problem decomposition into three subproblems. Two of these subproblems are solved by dynamic programming recurrence in polynomial time and third subproblem is solved during constant time. This algorithm requires the minimization of linear modulo functions. A polynomial time algorithm is used for this purpose.
引用
收藏
页码：275 / 287
页数：13
相关论文
共 50 条
  • [21] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
    Department of Computer Science, Shandong University, Jinan 250100, China
    Sci China Ser E Technol Sci, 3 (x9-311):
  • [22] An approximation polynomial-time algorithm for a sequence bi-clustering problem
    Kel'manov, A. V.
    Khamidullin, S. A.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (06) : 1068 - 1076
  • [23] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
    Shaohan Ma
    Dongmin Liang
    Science in China Series E: Technological Sciences, 1997, 40 : 301 - 311
  • [24] A POLYNOMIAL-TIME ALGORITHM FOR A LARGE SUBCLASS OF THE INTEGER KNAPSACK-PROBLEM
    MILANOV, PB
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1984, 37 (03): : 309 - 312
  • [25] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
    马绍汉
    梁东敏
    Science in China(Series E:Technological Sciences), 1997, (03) : 301 - 311
  • [26] A deterministic polynomial-time algorithm for Heilbronn's problem in three dimensions
    Lefmann, H
    Schmitt, N
    SIAM JOURNAL ON COMPUTING, 2002, 31 (06) : 1926 - 1947
  • [27] COMPUTATIONAL EXPERIENCE WITH A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE TRANSPORTATION PROBLEM
    IKURA, Y
    NEMHAUSER, GL
    DISCRETE APPLIED MATHEMATICS, 1986, 13 (2-3) : 239 - 248
  • [28] Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem
    Vass, Balazs
    Berczi-Kovacs, Erika
    Barabas, Abel
    Hajdu, Zsombor Laszlo
    Tapolcai, Janos
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 940 - 949
  • [29] A tabu search algorithm for the pallet loading problem
    R. Alvarez-Valdes
    F. Parreño
    J. M. Tamarit
    OR Spectrum, 2005, 27 : 43 - 61
  • [30] A tabu search algorithm for the pallet loading problem
    Alvarez-Valdes, R
    Parreño, F
    Tamarit, JM
    OR SPECTRUM, 2005, 27 (01) : 43 - 61
12345