Search Results - pseudo-polynomial dynamic programming algorithms*

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems

Authors: Camille Grange Michael Poss Eric Bourreau et al.

Contributors: Camille Grange Michael Poss Eric Bourreau et al.

Source: European Journal of Operational Research. 320:516-526

Subject Terms: Quantum optimization, Quantum Physics, Dynamic Programming, Scheduling, 0211 other engineering and technologies, FOS: Physical sciences, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Grover algorithm, [INFO] Computer Science [cs], Quantum computing, Dynamic programming, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Discrete Optimization, Optimization and Control (math.OC), FOS: Mathematics, Quantum Physics (quant-ph), Mathematics - Optimization and Control, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

File Description: application/pdf

Access URL: http://arxiv.org/abs/2408.05741
https://hal.science/hal-04991094v1
https://hal.science/hal-04617682v3/document
https://doi.org/10.1016/j.ejor.2024.09.005
https://hal.science/hal-04617682v3
https://hal.science/hal-04380572v1

Scheduling on parallel dedicated machines with job rejection.

Authors: Mor, Baruch Mosheiov, Gur

Source: International Journal of Production Research; Oct2024, Vol. 62 Issue 19, p6933-6940, 8p

Subject Terms: NP-hard problems, DYNAMIC programming, PRODUCTION scheduling, TARDINESS, PARALLEL algorithms

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

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

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

Subject Terms: *DYNAMIC programming, POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, NP-hard problems

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Authors: Aringhieri, Roberto Grosso, Andrea Hosteins, Pierre et al.

Source: Discrete Applied Mathematics. 253:103-121

Subject Terms: Critical Node Problem, Connectivity measure, Shortest paths, Dynamic programming, Polynomial time algorithms, 0211 other engineering and technologies, Connectivity measure, Critical Node Problem, Dynamic programming, Polynomial time algorithms, Shortest paths, Discrete Mathematics and Combinatorics, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

File Description: application/pdf

Access URL: https://iris.polito.it/handle/11583/2698736
https://iris.unito.it/handle/2318/1662827
https://dblp.uni-trier.de/db/journals/dam/dam253.html#AringhieriGHS19
https://www.sciencedirect.com/science/article/abs/pii/S0166218X18300039

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

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges.

Authors: Li, Xiao Guan, Xiucui Jia, Junhua et al.

Source: Journal of Global Optimization; Aug2025, Vol. 92 Issue 4, p951-972, 22p

Subject Terms: TREES, NP-hard problems, MATHEMATICAL optimization, GREEDY algorithms, DYNAMIC programming, GRAPH 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

Single‐Machine Scheduling to Minimize the Size of Input Buffer.

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

Source: Naval Research Logistics; Sep2025, Vol. 72 Issue 6, p810-824, 15p

Subject Terms: NP-hard problems, MIXED integer linear programming, BUFFER storage (Computer science), DYNAMIC programming, HEURISTIC, COMPUTER scheduling, HEURISTIC algorithms, EMPIRICAL research

Multitasking scheduling with job switching allowed between alternate periods.

Authors: Wang, Yan Wang, Jun-Qiang Huo, Yumei

Source: International Journal of Production Research. Aug2024, Vol. 62 Issue 16, p5966-5988. 23p.

Subject Terms: *DYNAMIC programming, *SCHEDULING, *SWITCHING costs, *SHIFT systems, *SUPPLEMENTARY employment, TARDINESS

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

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

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

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

Subject Terms: *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, POLYNOMIAL approximation, POINT set theory

Minimising the makespan on parallel identical machines with log-linear position-dependent processing times.

Authors: Cohen, Edut Shapira, Dana

Source: Journal of the Operational Research Society; Mar2025, Vol. 76 Issue 3, p581-589, 9p

Subject Terms: POLYNOMIAL time algorithms, POLYNOMIAL approximation, PRODUCTION scheduling, DYNAMIC programming, NP-hard problems

Single Machine Scheduling with a Restricted Weight-Modifying Activity to Minimize the Weighted Makespan.

Authors: Zuo, Lili Lu, Lingfa Zhang, Liqi

Source: International Journal of Foundations of Computer Science. Sep2025, p1-15. 15p.

Subject Terms: *SCHEDULING, *DYNAMIC programming, NP-hard problems, APPROXIMATION algorithms, POLYNOMIAL time algorithms

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

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

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

Subject Terms: SCHEDULING, PRODUCTION scheduling, POLYNOMIAL time algorithms, NP-hard problems, MANUFACTURING processes, DYNAMIC programming

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

Scheduling problems on parallel machines with machine-dependent generalized due-dates.

Authors: Mor, Baruch Mosheiov, Gur Shabtay, Dvir

Source: Annals of Operations Research. Apr2025, Vol. 347 Issue 3, p1455-1471. 17p.

Subject Terms: *DYNAMIC programming, *SCHEDULING, NP-hard problems, TARDINESS, HARDNESS

Rescheduling with New Orders Under Bounded Disruption.

Authors: Lendl, Stefan Pferschy, Ulrich Rener, Elena

Source: INFORMS Journal on Computing; Nov/Dec2024, Vol. 36 Issue 6, p1654-1675, 22p

Subject Terms: POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, SEARCH algorithms, DYNAMIC programming, COMPUTER scheduling

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

Exact algorithms for the product configuration problem.

Authors: Bogue, Eduardo T. Maciel, Lucas Noronha, Thiago F.

Source: International Transactions in Operational Research. Nov2023, Vol. 30 Issue 6, p3979-3992. 14p. 1 Diagram, 2 Charts, 2 Graphs.

Subject Terms: *SOFTWARE engineering, *ALGORITHMS, *DYNAMIC programming, *LINEAR programming, KNAPSACK problems

Fair allocation algorithms for indivisible items under structured conflict constraints.

Authors: Chiarelli, Nina Krnc, Matjaž Milanič, Martin et al.

Source: Computational & Applied Mathematics; Oct2023, Vol. 42 Issue 7, p1-21, 21p

Subject Terms: BIPARTITE graphs, GRAPH coloring, ALGORITHMS, INDEPENDENT sets, DYNAMIC programming, PROBLEM solving