Suchergebnisse - polynomial-time dynamic programming algorithms*

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Autoren: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe et al.

Weitere Verfasser: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe et al.

Schlagwörter: FOS: Computer and information sciences, Quantum Physics, Dynamic Programming, Data Structures and Algorithms, Quantum Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Physics (quant-ph), Quantum Random Access Memory

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2507.00823
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.14

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

Autoren: Ding, Wei Chen, Guangting Zhou, Yu et al.

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

Schlagwörter: *POLYNOMIAL time algorithms, *LOCATION problems (Programming), *SPANNING trees, *MATHEMATICAL optimization, *DYNAMIC programming

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

Autoren: Sun, Ruiqing¹ (AUTHOR) ruiqing2020@126.com

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

Schlagwörter: *DYNAMIC programming, POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, NP-hard problems

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

Autoren: Asahiro, Yuichi Jansson, Jesper Lin, Guohui et al.

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

Schlagwörter: *POLYNOMIAL time algorithms, *DYNAMIC programming, *ALGORITHMS, *COMPUTER science

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

Autoren: Yu, Tan Zhong, Xiang Guan, Yongpei

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

Schlagwörter: *DYNAMIC programming, *COST control, *PRODUCT quality, *ALGORITHMS, POLYNOMIAL time algorithms

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

Autoren: Huang, Shanming Xue, Feng Yang, Wanshuo

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

Schlagwörter: *DYNAMIC programming, *ALGORITHMS, *PROBLEM solving, POLYNOMIAL time algorithms, BIPARTITE graphs

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

Autoren: Zhang, Hao Zheng, Xiya Liu, Zhonghao et al.

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

Schlagwörter: *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, POLYNOMIAL approximation, POINT set theory

Scheduling on identical machines with preemption and setup times.

Autoren: Haned, Amina Kerdali, Abida Boudhar, Mourad

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

Schlagwörter: *SETUP time, *DYNAMIC programming, POLYNOMIAL time algorithms, POLYNOMIAL approximation, GENETIC algorithms

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Autoren: Halman, Nir Nannicini, Giacomo

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

Schlagwörter: OPERATIONS research, KNAPSACK problems, DYNAMIC programming, INVENTORY control, DECISION making, APPROXIMATION algorithms

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

Autoren: Phosavanh, Johnson Oron, Daniel

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

Schlagwörter: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms

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

Autoren: Zheng, Feifeng Li, Na Xu, Yinfeng et al.

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

Schlagwörter: SCHEDULING, PRODUCTION scheduling, POLYNOMIAL time algorithms, NP-hard problems, MANUFACTURING processes, DYNAMIC programming

Minimizing total completion time with machine-dependent priority lists.

Autoren: Ravindran Vijayalakshmi, Vipin Schröder, Marc Tamir, Tami

Quelle: European Journal of Operational Research. Jun2024, Vol. 315 Issue 3, p844-854. 11p.

Schlagwörter: *DYNAMIC programming, *MACHINERY, *SCHEDULING, POLYNOMIAL time algorithms, COMPUTATIONAL complexity

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

Autoren: Barbato, Michele Ceselli, Alberto Righini, Giovanni

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

Schlagwörter: POLYNOMIAL time algorithms, DYNAMIC programming, COMBINATORIAL optimization, AUTOMATED storage retrieval systems, WAREHOUSES, ALGORITHMS

Quantum algorithms for one-sided crossing minimization.

Autoren: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

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

Schlagwörter: *POLYNOMIAL time algorithms, *DYNAMIC programming, *QUANTUM graph theory, *ALGORITHMS

Precedence‐Constrained Shortest Path.

Autoren: Büsing, Christina John, Dennis Mathwieser, Corinna

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

Schlagwörter: GRAPH theory, NP-hard problems, DYNAMIC programming, POLYNOMIAL time algorithms, PROBLEM solving, ROUTE choice

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

Autoren: Kong, Fanyu Zhang, Yuzhong

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

Schlagwörter: *DYNAMIC programming, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL functions, APPROXIMATION algorithms, MONOTONIC functions, EXPONENTIAL functions

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

Autoren: Gawiejnowicz, Stanisław Halman, Nir

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

Schlagwörter: *APPROXIMATION algorithms, *FLOW shops, *DYNAMIC programming, *POLYNOMIAL time algorithms, *SCHEDULING, *MATHEMATICAL optimization

Pairwise Distances and the Problem of Multiple Optima.

Autoren: LIBESKIND-HADAS, RAN¹ (AUTHOR) rhadas@cmc.edu

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

Schlagwörter: *POLYNOMIAL time algorithms, *DYNAMIC programming

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

Autoren: Koca, Esra Koksalan, G. Irmak

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

Schlagwörter: CARBON emissions, COST functions, INDUSTRIAL costs, DYNAMIC programming, SATISFIABILITY (Computer science), GENERALIZATION, POLYNOMIAL time algorithms

An Inexact Projected Regularized Newton Method for Fused Zero-norms Regularization Problems.

Autoren: Yuqia Wu Shaohua Pan Xiaoqi Yang

Quelle: Journal of Machine Learning Research. Jan-Dec2024, Vol. 25, p1-48. 48p.

Schlagwörter: *DYNAMIC programming, POLYNOMIAL time algorithms, IMAGE processing, POINT set theory, MACHINE learning