Search Results - polynomial-time dynamic programming algorithms

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

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

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

Subject Terms: 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

File Description: application/pdf

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

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

Authors: Kong, Fanyu Zhang, Yuzhong

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

Subject Terms: *DYNAMIC programming, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL functions, APPROXIMATION algorithms, MONOTONIC functions, EXPONENTIAL functions

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

Authors: Phosavanh, Johnson Oron, Daniel

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

Subject Terms: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms

Quantum algorithms for one-sided crossing minimization.

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

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

Subject Terms: *POLYNOMIAL time algorithms, *DYNAMIC programming, *QUANTUM graph theory, *ALGORITHMS

Scheduling with assignable due dates, two competing agents and late work related criteria.

Authors: Li, Shi-Sheng Sang, Yao-Wen Chen, Ren-Xia et al.

Source: Computers & Operations Research. Oct2025, Vol. 182, pN.PAG-N.PAG. 1p.

Subject Terms: *WORKING hours, *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, TARDINESS

Minimizing total late work on a single machine with generalized due-dates.

Authors: Mosheiov, Gur Oron, Daniel Shabtay, Dvir

Source: European Journal of Operational Research. Sep2021, Vol. 293 Issue 3, p837-846. 10p.

Subject Terms: *DYNAMIC programming, *MACHINERY, POLYNOMIAL time algorithms

Dynamic programming algorithms for producing food mixture packages by automatic combination weighers

Authors: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

Source: Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol 8, Iss 5, Pp JAMDSM0065-JAMDSM0065 (2014)

Subject Terms: engineering optimization, food packaging, 0-1 integer programming, dynamic programming, pseudo-polynomial time algorithms, Engineering machinery, tools, and implements, TA213-215, Mechanical engineering and machinery, TJ1-1570

File Description: electronic resource

Relation: https://www.jstage.jst.go.jp/article/jamdsm/8/5/8_2014jamdsm0065/_pdf/-char/en; https://doaj.org/toc/1881-3054

Access URL: https://doaj.org/article/ed0eaa0586944afe93103062a2fc9bb9

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time

Authors: James B. Saxe

Source: SIAM Journal on Algebraic Discrete Methods. 1:363-369

Subject Terms: Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 0102 computer and information sciences, bandwidth of a graph, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/3782384
https://doi.org/10.1137/0601042

A General Framework for Enumerating Equivalence Classes of Solutions.

Authors: Wang, Yishu Mary, Arnaud Sagot, Marie-France et al.

Source: Algorithmica; Oct2023, Vol. 85 Issue 10, p3003-3023, 21p

Subject Terms: DYNAMIC programming, PROBLEM solving, ALGORITHMS, POLYNOMIAL time algorithms

On Optimal Trees for Irregular Gather and Scatter Collectives.

Authors: Traff, Jesper Larsson¹ (AUTHOR) traff@par.tuwien.ac.at

Source: IEEE Transactions on Parallel & Distributed Systems. Sep2019, Vol. 30 Issue 9, p2060-2074. 15p.

Subject Terms: *DYNAMIC programming, *TELECOMMUNICATION systems, POLYNOMIAL time algorithms, NP-hard problems, HEURISTIC algorithms

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands

Authors: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Contributors: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Subject Terms: FOS: Computer and information sciences, F.2, F.2.0, F.2.3, G.2, G.2.1, G.2.2, partition function, Discrete Mathematics (cs.DM), MFE, FOS: Physical sciences, Computational Complexity (cs.CC), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Physics - Biological Physics, dynamic programming, computational complexity, secondary structure, Biomolecules (q-bio.BM), DNA, algorithm analysis and design, nucleic acid, Computer Science - Computational Complexity, Quantitative Biology - Biomolecules, Biological Physics (physics.bio-ph), FOS: Biological sciences, Minimum free energy, RNA, ddc:004, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.09676
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.130

Minimizing the number of late jobs and total late work with step-learning.

Authors: Phosavanh, Johnson Oron, Daniel

Source: European Journal of Operational Research. Mar2025, Vol. 321 Issue 3, p734-749. 16p.

Subject Terms: *DYNAMIC programming, *PRODUCTION scheduling, *UNEMPLOYMENT, *PROBLEM solving, *ALGORITHMS

Experimental Approach to Exact and Random Boolean-Widths and Their Comparison with Other Width Parameters.

Authors: Sharmin, Sadia

Source: Computer Journal; Sep2022, Vol. 65 Issue 9, p2392-2399, 8p

Subject Terms: RANDOM graphs, TREE graphs, APPROXIMATION algorithms, POLYNOMIAL time algorithms, DYNAMIC programming, GRAPH algorithms, TREE branches

Dynamic programming algorithms for selection of waste disposal ports in cruise shipping

Authors: Wang, S Zhen, L Zhuge, D et al.

Contributors: Wang, S Zhen, L Zhuge, D et al.

Source: Transportation Research Part B: Methodological. 108:235-248

Subject Terms: Water transportation, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, Cruise ship, 14. Life underwater, 02 engineering and technology, Dynamic programming, Waste disposal, 12. Responsible consumption

Access URL: https://econpapers.repec.org/RePEc:eee:transb:v:108:y:2018:i:c:p:235-248
https://ideas.repec.org/a/eee/transb/v108y2018icp235-248.html
https://www.sciencedirect.com/science/article/pii/S0191261517303326
http://ira.lib.polyu.edu.hk/handle/10397/79958

Talent scheduling with daily working capacity and scene changeover times.

Authors: Yang, Zhaoqi Tanaka, Shunji Lin, Bertrand M.T.

Source: Omega. Jan2026, Vol. 138, pN.PAG-N.PAG. 1p.

Subject Terms: *SCHEDULING, *DYNAMIC programming, *WORKING hours, *EMPIRICAL research, *RESOURCE allocation, METAHEURISTIC algorithms, CONSTRAINED optimization, MIXED integer linear programming

Rapid dynamic programming algorithms for RNA secondary structure

Authors: Michael S. Waterman Temple F. Smith

Source: Advances in Applied Mathematics. 7:455-464

Subject Terms: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, Analysis of algorithms and problem complexity, Prediction of RNA secondary structure, new dynamic programming algorithms, Applied Mathematics, Physiological, cellular and medical topics, biochemistry, polynomial time algorithm, Dynamic programming, linear RNA sequence

File Description: application/xml

Access URL: https://zbmath.org/3982976
https://doi.org/10.1016/0196-8858(86)90025-4
https://www.sciencedirect.com/science/article/pii/0196885886900254
https://dornsife.usc.edu/assets/sites/516/docs/papers/msw_papers/msw-075.pdf
http://dornsife.usc.edu/assets/sites/516/docs/papers/msw_papers/msw-075.pdf
https://www.sciencedirect.com/science/article/abs/pii/0196885886900254
https://core.ac.uk/display/82170261

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front †.

Authors: Dupin, Nicolas Nielsen, Frank Talbi, El-Ghazali et al.

Source: Mathematics (2227-7390). Feb2021, Vol. 9 Issue 4, p453. 1p.

Subject Terms: *DYNAMIC programming, *POLYNOMIAL time algorithms, *ALGORITHMS, *POLYNOMIALS, *PARALLEL programming, *RADIUS (Geometry)

Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles

Authors: Feifeng Zheng Yaxin Pang Ming Liu et al.

Source: Journal of Combinatorial Optimization. 39:708-724

Subject Terms: 0211 other engineering and technologies, 02 engineering and technology

Access URL: https://link.springer.com/article/10.1007/s10878-019-00508-9
https://ideas.repec.org/a/spr/jcomop/v39y2020i3d10.1007_s10878-019-00508-9.html
https://doi.org/10.1007/s10878-019-00508-9
https://dblp.uni-trier.de/db/journals/jco/jco39.html#ZhengPLX20

Structural Parameterizations with Modulator Oblivion.

Authors: Jacob, Ashwin Panolan, Fahad Raman, Venkatesh et al.

Source: Algorithmica; Aug2022, Vol. 84 Issue 8, p2335-2357, 23p

Subject Terms: CHARTS, diagrams, etc., POLYNOMIAL time algorithms, GRAPH algorithms, DYNAMIC programming, APPROXIMATION algorithms, PARAMETERIZATION, PROBLEM solving

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Authors: Bentert, Matthias

Subject Terms: graph diameter, shortest paths computation, flow and cut problems, resource allocation, computational biology, Algorithms and data structures

File Description: application/pdf

Relation: Foundations of computing

Access URL: https://library.oapen.org/handle/20.500.12657/54061