Search Results - polynomial-time (dynamic OR dynamika) programming algorithms~

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

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

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

An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem

Authors: Segev, Danny

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

Access URL: http://www.jstor.org/stable/24540904

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

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

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

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

Genetic Network Completion Using Dynamic Programming and Least-Squares Fitting
動的計画法と最小二乗法を用いた遺伝子ネットワーク補完

Authors: Nakajima, Natsu, Nakajima, Natsu

Subject Terms: Gene regulatory networks, Differential equations, Dynamic programming, Least-squares fitting, Time-varying genetic networks, Polynomial-time algorithms

動的計画法と最小二乗法を用いた遺伝子ネットワーク補完

Authors: 仲嶋, なつ 阿久津, 達也 山本, 章博 et al.

Contributors: 仲嶋, なつ 阿久津, 達也 山本, 章博 et al.

Subject Terms: Gene regulatory networks, Differential equations, Dynamic programming, Least-squares fitting, Time-varying genetic networks, Polynomial-time algorithms

File Description: application/pdf

Access URL: https://ndlsearch.ndl.go.jp/books/R100000039-I9207202

Degree: 博士(情報学) -- 京都大学, Kyoto University

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

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

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

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

On Huang and Wong’s algorithm for generalized binary split trees

Authors: Chrobak, Marek Golin, Mordecai Munro, J Ian et al.

Source: Acta Informatica. 59(6)

Subject Terms: Computation Theory and Mathematics, Computer Software, Data Format, Computation Theory & Mathematics

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/2x14723r
https://escholarship.org/content/qt2x14723r/qt2x14723r.pdf

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

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

Fine-Grained Connections Between Exponential and Polynomial Time

Authors: Schneider, Stefan

Subject Terms: Computer science, Dynamic Programming, Fine-Grained Complexity, Satisfiability, Stable Matching, Strong Exponential Time Hypothesis

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/3rs5v3nc
https://escholarship.org/content/qt3rs5v3nc/qt3rs5v3nc.pdf

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

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

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

Authors: Li, S-S Sang, Y-W Chen, R-X et al.

Subject Terms: dynamic programming, SCHEDULING PROBLEM, Disjoint sets, Two-agent, Scheduling, Two agents, Work-related, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Job shop scheduling, Scheduling algorithms, Single- machines, Assignable due dates, Due dates, Single machine, Key feature, Predefined sets, Late work

File Description: text

Access URL: https://eprints.sztaki.hu/10920/