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 条
  • [1] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
    KANNAN, R
    LIPTON, RJ
    JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
  • [2] A Polynomial-Time Algorithm for the Maximum Clique Problem
    Akbari, Zohreh O.
    2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2013, : 503 - 507
  • [3] A stable, polynomial-time algorithm for the eigenpair problem
    Armentano, Diego
    Beltran, Carlos
    Buergisser, Peter
    Cucker, Felipe
    Shub, Michael
    JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2018, 20 (06) : 1375 - 1437
  • [4] A polynomial-time algorithm for the bistable roommates problem
    Sethuraman, J
    Teo, CP
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (03) : 486 - 497
  • [5] A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
    Nong, Q. Q.
    Cheng, T. C. E.
    Ng, C. T.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (31-33) : 2978 - 2986
  • [6] POLYNOMIAL-TIME ALGORITHM FOR KNAPSACK PROBLEM WITH 2 VARIABLES
    HIRSCHBERG, DS
    WONG, CK
    JOURNAL OF THE ACM, 1976, 23 (01) : 147 - 154
  • [7] A polynomial-time algorithm for the change-making problem
    Pearson, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 231 - 234
  • [8] A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
    Benkert, Marc
    Gudmundsson, Joachim
    Knauer, Christian
    Van Oostrum, Rene
    Wolff, Alexander
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2009, 19 (03) : 267 - 288
  • [9] Polynomial-time Algorithm for Distributed Server Allocation Problem
    Sawa, Takaaki
    He, Fujun
    Kawabata, Akio
    Oki, Eiji
    PROCEEDING OF THE 2019 IEEE 8TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET), 2019,
  • [10] A polynomial-time approximation algorithm for a geometric dispersion problem
    Benkert, Marc
    Gudmundsson, Joachim
    Knauer, Christian
    Moet, Esther
    van Oostrum, Rene
    Wolff, Alexander
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 166 - 175
12345