Výsledky vyhledávání - 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ískat 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ískat 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ískat 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ískat plný text

Talent scheduling with daily working capacity and scene changeover times Autor Yang, Zhaoqi, Tanaka, Shunji, Lin, Bertrand M.T.

“… Additionally, we introduce a polynomial-time dynamic programming algorithm for the special case where the filming order of all scenes is predetermined…”
Získat plný text

CON/SLK due date assignment and scheduling on a single machine with two agents Autor Yin, Yunqiang, Wang, Du-Juan, Wu, Chin-Chia, Cheng, T.C.E.

“…We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their…”
Získat 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ískat plný text

Minimizing the number of late jobs and total late work with step-learning Autor Phosavanh, Johnson, Oron, Daniel

“… dynamic programming algorithms. We also…”
Získat plný text

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

“…In this paper we investigate the problem of testing the bandwidth of a graph: Given a graph, $G$, can the vertices of $G$ be mapped to distinct positive…”
Získat 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ískat plný text

NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks Autor Yu, Ya-Ju, Wang, Jhih-Kai

“…In narrowband Internet of Things (NB-IoT), a link adaptation technique can be performed, considering multiple resource unit types, repetition numbers, and…”
Získat plný text

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

“… Two separate mixed integer linear programming…”
Získat 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ískat plný text

Jane: a new tool for the cophylogeny reconstruction problem Autor Conow, Chris, Fielder, Daniel, Ovadia, Yaniv, Libeskind-Hadas, Ran

“… Results The Jane software tool uses a polynomial time dynamic programming algorithm in conjunction with a genetic algorithm to find…”
Získat 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ískat plný text

Dominating set of rectangles intersecting a straight line Autor Pandit, Supantha

“…The Minimum Dominating Set ( MDS ) problem is one of the well-studied problems in computer science. It is well-known that this problem is NP -hard for simple…”
Získat plný text

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost Autor He, Cheng, Leung, Joseph Y.-T., Lee, Kangbok, Pinedo, Michael L.

“…We consider the problem of scheduling a set of n jobs on a single machine with parallel batching and with rejection being allowed. Two bi-criteria problems are…”
Získat plný text

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times Autor Wang, Dujuan, Yin, Yunqiang, Cheng, T.C.E.

“…We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the…”
Získat 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ískat plný text

The dry dock scheduling problem Autor Jia, Shuai, Li, Chung-Lun, Meng, Qiang

“…Dry docks are essential facilities for ship maintenance and thus are critical assets of a shipyard. In this paper, we study a dry dock scheduling problem that…”
Získat plný text