Výsledky vyhľadávania - polynomial-time dynamic programming algorithms

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses Autor Barbato, Michele, Ceselli, Alberto, Righini, Giovanni

“… In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality…”
Získať plný text

A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit Autor Chang, Yin-Wen, Collins, Michael

“… However, the impact on complexity after imposing such a constraint is not well studied. In this paper, we describe a dynamic programming algorithm for phrase-based decoding with a fixed distortion limit…”
Získať plný text

Dynamic programming track-before-detect algorithm for radar target detection based on polynomial time series prediction Autor Zheng, Daikun, Wang, Shouyong, Meng, Qingwen

“…An improved dynamic programming track-before-detect (DP-TBD) algorithm is proposed in this study…”
Získať plný text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms Autor Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the…”
Získať plný text

NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract Autor Akbalik, Ayse, Hadj-Alouane, Atidel B., Sauer, Nathalie, Ghribi, Houcem

“…•Pseudo-polynomial time dynamic programming algorithm is given for the general case.•Polynomial time algorithms are proposed under restricted parameters…”
Získať plný text

A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology Autor Xiao, Liyun, Bu, Tian-Ming, Wang, Jiangtao

“… This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness…”
Získať plný text

The prize-collecting single machine scheduling with bounds and penalties Autor Hu, Guojun, Pan, Pengxiang, Liu, Suding, Yang, Ping, Xie, Runtao

“…This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of n jobs and a single…”
Získať plný text

Nonconvex piecewise linear knapsack problems Autor Kameshwaran, S., Narahari, Y.

“… Two separate mixed integer linear programming…”
Získať plný text

Integrated pricing and production scheduling of multiple customized products with a common base product Autor Yue, Qing, Chen, Zhi-Long, Wan, Guohua

“… Dynamic pricing is a popular tactical tool commonly used by sellers to match supply with demand when there is a limited capacity and high demand uncertainty over time…”
Získať plný text

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work Autor Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“… We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial…”
Získať plný text

Two-agent single-machine scheduling to minimize the batch delivery cost Autor Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Wang, Du-Juan, Wu, Chin-Chia

“…•Numerical studies are conducted to evaluate the performance of the algorithms. We consider integrated production and batch delivery scheduling in a make-to-order…”
Získať plný text

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs Autor Boyacı, Arman, Ekim, Tinaz, Shalom, Mordechai

“… In this paper, we consider the time complexity of the problem in proper interval graphs, and propose a polynomial-time dynamic programming algorithm…”
Získať plný text

A single-item lot-sizing problem with a by-product and inventory capacities Autor Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco

“…•A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is developed…”
Získať plný text

A polynomial-time algorithm for Outerplanar Diameter Improvement Autor Cohen, Nathann, Gonçalves, Daniel, Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M., Weller, Mathias

“… We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues…”
Získať plný text

Optimal cuts and partitions in tree metrics in polynomial time Autor Karpinski, Marek, Lingas, Andrzej, Sledneu, Dzmitry

“…We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree…”
Získať plný text

Efficient computation of evacuation routes on a three-dimensional geometric network Autor Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.

“…•We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorithm and two polynomial time approximation algorithms…”
Získať plný text

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs Autor Shen, Siqian, Smith, J. Cole

“…‐time dynamic programming algorithms for solving these problems on tree structures and on series…”
Získať plný text

A polynomial-time exact algorithm for the sectionalizing switch allocation problem Autor Usberti, Fábio Luiz, González, José Federico Vizcaino, Assis, Laura Silva de, Cavellucci, Celso

“… In this paper, we show that it is in fact tractable by presenting the first exact polynomial-time algorithm, based on dynamic programming…”
Získať plný text

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time Autor Saxe, James B.

“…$? We exhibit an algorithm to solve this problem in $O ( f ( k )N^{k + 1} )$ time, where $N$ is the number of vertices of $G$ and $f ( k )$ depends only on $k…”
Získať plný text

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops Autor Dong, Jianming, Jin, Ruyan, Hu, Jueliang, Lin, Guohui

“… a pseudo-polynomial time dynamic programming exact algorithm to solve our scheduling problem with any fixed number of two-stage openshops…”
Získať plný text