Suchergebnisse - pseudo-polynomial dynamic programming algorithms

Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach von 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 …”
Volltext

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

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

Two-agent single-machine scheduling to minimize the batch delivery cost von 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 …”
Volltext

Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling von 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 …”
Volltext

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

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

CON/SLK due date assignment and scheduling on a single machine with two agents von 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 …”
Volltext

The dry dock scheduling problem von 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 …”
Volltext

NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks von 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 …”
Volltext

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

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

Complexity and algorithms for copy-number evolution problems von 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 …”
Volltext

A single-item lot-sizing problem with a by-product and inventory capacities von 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 …”
Volltext

Using submodularity within column generation to solve the flight-to-gate assignment problem von 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 …”
Volltext

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work von 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 …”
Volltext

Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection von 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 …”
Volltext

A novel two-stage approach for energy-efficient timetabling for an urban rail transit network von 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 …”
Volltext

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

“… Two separate mixed integer linear programming …”
Volltext

Two-agent scheduling problems under rejection budget constraints von 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 …”
Volltext

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

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

Single-machine common due date total earliness/tardiness scheduling with machine unavailability von 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 …”
Volltext

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges von 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 …”
Volltext