Výsledky vyhledávání - polynomial-time (dynamic OR dynamika) programming algorithms*

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Autoři: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe a další

Témata: FOS: Computer and information sciences, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)

A polynomial-time exact algorithm for the connected k-facility location problem on trees.

Autoři: Ding, Wei Chen, Guangting Zhou, Yu a další

Zdroj: Discrete Mathematics, Algorithms & Applications. Oct2025, Vol. 17 Issue 7, p1-33. 33p.

Témata: *POLYNOMIAL time algorithms, *LOCATION problems (Programming), *SPANNING trees, *MATHEMATICAL optimization, *DYNAMIC programming

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Autoři: Halman, Nir Klabjan, Diego Mostagir, Mohamed a další

Zdroj: Mathematics of Operations Research, 2009 Aug 01. 34(3), 674-685.

Přístupová URL adresa: https://www.jstor.org/stable/40538438

Polynomial-time equivalences and refined algorithms for longest common subsequence variants.

Autoři: Asahiro, Yuichi Jansson, Jesper Lin, Guohui a další

Zdroj: Discrete Applied Mathematics. Aug2024, Vol. 353, p44-64. 21p.

Témata: *POLYNOMIAL time algorithms, *DYNAMIC programming, *ALGORITHMS, *COMPUTER science

W-prize-collecting with release dates on a single machine.

Autoři: Sun, Ruiqing¹ (AUTHOR) ruiqing2020@126.com

Zdroj: Journal of Industrial & Management Optimization. Jan2025, Vol. 21 Issue 1, p1-14. 14p.

Témata: *DYNAMIC programming, POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, NP-hard problems

An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem

Autoři: Segev, Danny

Zdroj: Mathematics of Operations Research, 2014 May 01. 39(2), 432-444.

Přístupová URL adresa: http://www.jstor.org/stable/24540904

Polynomial-time algorithms for deterministic uncapacitated lot-sizing problem with heterogeneous production cycles.

Autoři: Yu, Tan Zhong, Xiang Guan, Yongpei

Zdroj: Operations Research Letters. Jul2025, Vol. 61, pN.PAG-N.PAG. 1p.

Témata: *DYNAMIC programming, *COST control, *PRODUCT quality, *ALGORITHMS, POLYNOMIAL time algorithms

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Autoři: Halman, Nir Nannicini, Giacomo

Zdroj: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1306-1327, 22p

Témata: OPERATIONS research, KNAPSACK problems, DYNAMIC programming, INVENTORY control, DECISION making, APPROXIMATION algorithms

Precedence‐Constrained Shortest Path.

Autoři: Büsing, Christina John, Dennis Mathwieser, Corinna

Zdroj: Networks; Oct2025, Vol. 86 Issue 3, p282-295, 14p

Témata: GRAPH theory, NP-hard problems, DYNAMIC programming, POLYNOMIAL time algorithms, PROBLEM solving, ROUTE choice

Lot scheduling on a single machine to minimize total weighted completion time.

Autoři: Zheng, Feifeng Li, Na Xu, Yinfeng a další

Zdroj: RAIRO: Operations Research (2804-7303); 2025, Vol. 59 Issue 5, p3153-3167, 15p

Témata: SCHEDULING, PRODUCTION scheduling, POLYNOMIAL time algorithms, NP-hard problems, MANUFACTURING processes, DYNAMIC programming

Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop.

Autoři: Gawiejnowicz, Stanisław Halman, Nir

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 377, p429-435. 7p.

Témata: *APPROXIMATION algorithms, *FLOW shops, *DYNAMIC programming, *POLYNOMIAL time algorithms, *SCHEDULING, *MATHEMATICAL optimization

Efficient approximate algorithms for a class of dynamic lot size problems under product substitution.

Autoři: Huang, Shanming Xue, Feng Yang, Wanshuo

Zdroj: Journal of Industrial & Management Optimization. Jan2024, Vol. 20 Issue 1, p1-24. 24p.

Témata: *DYNAMIC programming, *ALGORITHMS, *PROBLEM solving, POLYNOMIAL time algorithms, BIPARTITE graphs

Scheduling on identical machines with preemption and setup times.

Autoři: Haned, Amina Kerdali, Abida Boudhar, Mourad

Zdroj: International Journal of Production Research; Jan2024, Vol. 62 Issue 1/2, p444-459, 16p

Témata: SETUP time, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DYNAMIC programming, GENETIC algorithms

The K$K$‐prize‐collecting coverage problem by aligned disks.

Autoři: Zhang, Hao Zheng, Xiya Liu, Zhonghao a další

Zdroj: International Transactions in Operational Research. Jan2025, p1. 21p. 8 Illustrations.

Témata: *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, POLYNOMIAL approximation, POINT set theory

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.

Autoři: Barbato, Michele Ceselli, Alberto Righini, Giovanni

Zdroj: Journal of Scheduling; Aug2024, Vol. 27 Issue 4, p393-407, 15p

Témata: POLYNOMIAL time algorithms, DYNAMIC programming, COMBINATORIAL optimization, AUTOMATED storage retrieval systems, WAREHOUSES, ALGORITHMS

Capacitated lot sizing problem with periodic carbon emission constraints and multiple resources.

Autoři: Koca, Esra Koksalan, G. Irmak

Zdroj: International Journal of Production Research; Oct2023, Vol. 61 Issue 19, p6589-6601, 13p, 1 Chart, 1 Graph

Témata: CARBON emissions, COST functions, INDUSTRIAL costs, DYNAMIC programming, SATISFIABILITY (Computer science), GENERALIZATION, POLYNOMIAL time algorithms

Knapsack Problems with Monotonically Non-Decreasing Variable Weights (Profits) of Items.

Autoři: Kong, Fanyu Zhang, Yuzhong

Zdroj: International Journal of Foundations of Computer Science. Jul2025, p1-12. 12p.

Témata: *DYNAMIC programming, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL functions, APPROXIMATION algorithms, MONOTONIC functions, EXPONENTIAL functions

Quantum algorithms for one-sided crossing minimization.

Autoři: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

Zdroj: Theoretical Computer Science. Oct2025, Vol. 1052, pN.PAG-N.PAG. 1p.

Témata: *POLYNOMIAL time algorithms, *DYNAMIC programming, *QUANTUM graph theory, *ALGORITHMS

Pairwise Distances and the Problem of Multiple Optima.

Autoři: LIBESKIND-HADAS, RAN¹ (AUTHOR) rhadas@cmc.edu

Zdroj: Journal of Computational Biology. Jul2024, Vol. 31 Issue 7, p638-650. 13p.

Témata: *POLYNOMIAL time algorithms, *DYNAMIC programming

Two-agent single-machine scheduling with a rate-modifying activity.

Autoři: Phosavanh, Johnson Oron, Daniel

Zdroj: European Journal of Operational Research. Feb2024, Vol. 312 Issue 3, p866-876. 11p.

Témata: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms