Search Results - pseudo-polynomial dynamic programming algorithms

Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach by Engler, Martin S., Caron, Bertrand, Veen, Lourens, Geerke, Daan P., Mark, Alan E., Klau, Gunnar W.

“…A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a wide variety of molecules can be…”
Get full text

An optimization model for freight transport using urban rail transit by Ozturk, Onur, Patrick, Jonathan

“…•Approximation and dynamic programming algorithms for two station cases.•Multiple station problem modeled as an interval graph…”
Get full text

Two-agent single-machine scheduling to minimize the batch delivery cost by Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Wang, Du-Juan, Wu, Chin-Chia

“…•Numerical studies are conducted to evaluate the performance of the algorithms. We consider integrated production and batch delivery scheduling in a make-to-order…”
Get full text

Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling by Rasti-Barzoki, Morteza, Hejazi, Seyed Reza

“… We propose a pseudo-polynomial dynamic programming algorithm to solve this problem, which shows that the problem is ordinary NP-hard…”
Get full text

Single machine scheduling with assignable due dates to minimize maximum and total late work by Justkowiak, Jan-Erik, Kovalev, Sergey, Kovalyov, Mikhail Y., Pesch, Erwin

“…•Two pseudo-polynomial dynamic programming algorithms and an FPTAS are described for the latter…”
Get full text

CON/SLK due date assignment and scheduling on a single machine with two agents by Yin, Yunqiang, Wang, Du-Juan, Wu, Chin-Chia, Cheng, T.C.E.

“…We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their…”
Get full text

The dry dock scheduling problem by Jia, Shuai, Li, Chung-Lun, Meng, Qiang

“…Dry docks are essential facilities for ship maintenance and thus are critical assets of a shipyard. In this paper, we study a dry dock scheduling problem that…”
Get full text

NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks by Yu, Ya-Ju, Wang, Jhih-Kai

“…In narrowband Internet of Things (NB-IoT), a link adaptation technique can be performed, considering multiple resource unit types, repetition numbers, and…”
Get full text

Scheduling linear deteriorating jobs with rejection on a single machine by Cheng, Yushao, Sun, Shijie

“… We show that these problems are NP-hard, and design algorithms based on dynamic programming…”
Get full text

Complexity and algorithms for copy-number evolution problems by El-Kebir, Mohammed, Raphael, Benjamin J., Shamir, Ron, Sharan, Roded, Zaccaria, Simone, Zehavi, Meirav, Zeira, Ron

“…Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent…”
Get full text

A single-item lot-sizing problem with a by-product and inventory capacities by Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco

“…•A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is developed…”
Get full text

Using submodularity within column generation to solve the flight-to-gate assignment problem by Li, Yijiang, Clarke, John-Paul, Dey, Santanu S.

“…•Use of submodularity in column generation in solving pricing problems.•Combination of exact algorithms and approximation algorithms in solving pricing problems…”
Get full text

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work by Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“… We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial…”
Get full text

Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection by Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur

“…•We study extensions of a minmax due-date assignment problem with a bound on due-dates.•The first extension is to position-dependent processing times.•A…”
Get full text

A novel two-stage approach for energy-efficient timetabling for an urban rail transit network by Huang, Kang, Liao, Feixiong

“…•A novel model reformulation as a tree knapsack problem is developed to determine train running times by a pseudo-polynomial dynamic programming algorithm…”
Get full text

Nonconvex piecewise linear knapsack problems by Kameshwaran, S., Narahari, Y.

“… Two separate mixed integer linear programming…”
Get full text

Two-agent scheduling problems under rejection budget constraints by Oron, Daniel

“…•We consider pooled rejection budgets as well as agent dedicated budgets.•We provide efficient pseudo-polynomial time dynamic programming algorithms for the NP-hard problems under consideration…”
Get full text

Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection by Atsmony, Matan, Mosheiov, Gur

“… A pseudo-polynomial dynamic programming algorithm is introduced for this NP-hard problem…”
Get full text

Single-machine common due date total earliness/tardiness scheduling with machine unavailability by Bülbül, Kerem, Kedad-Sidhoum, Safia, Şen, Halil

“…Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints…”
Get full text

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges by Li, Xiao, Guan, Xiucui, Jia, Junhua, Pardalos, Panos M.

“…The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD) has significant implications in diverse areas such as transportation…”
Get full text