Suchergebnisse - pseudo-polynomial (dynamic OR dynamika) programming algorithms~

Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items von Lalou, Mohammed, Kheddouci, Hamamache

“… We develop pseudo-polynomial algorithms to solve this new constrained version in the cases where the dependencies …”
Volltext

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem von Arkhipov, Dmitry, Battaïa, Olga, Lazarev, Alexander

“… programming and therefore are time-consuming. In this paper, a new pseudo-polynomial algorithm is proposed to find a makespan lower bound for RCPSP …”
Volltext

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time von Letchford, Adam N., Salazar-González, Juan-José

“… •New mathematical models for the Capacitated Vehicle Routing Problem.•Lower bounds computable in pseudo-polynomial time …”
Volltext

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time von Batra, Jatin, Garg, Naveen, Kumar, Amit

“… We give the first pseudo-polynomial time constant approximation algorithm for this problem …”
Volltext

A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks von Vizcaino González, José Federico, Lyra, Christiano, Usberti, Fábio Luiz

“… ► The paper rescues dynamic programming for solving the capacitor allocation problem …”
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

A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs von Bunn, Kevin A., Ventura, José A.

“… •A pseudo-polynomial algorithm to solve the two-product capacitated dynamic lot-sizing problem is proposed …”
Volltext

Arc flow formulations based on dynamic programming: Theoretical foundations and applications von de Lima, Vinícius L., Alves, Cláudio, Clautiaux, François, Iori, Manuel, Valério de Carvalho, José M.

“… •Derivation of arc flow models from an underlying dynamic programming network.•Structure of arc-flow models …”
Volltext

Mathematical models and decomposition methods for the multiple knapsack problem von Dell’Amico, Mauro, Delorme, Maxence, Iori, Manuel, Martello, Silvano

“… •The Multiple Knapsack Problem is studied.•New pseudo-polynomial formulations for the problem are described …”
Volltext

Single-machine scheduling of multiple projects with controllable processing times von Geng, Zhichao, Yuan, Jinjiang

“… •The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total …”
Volltext

Multitasking scheduling with alternate periods von Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong

“… ) -approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant …”
Volltext

Selecting a subset of diverse points based on the squared euclidean distance von Eremeev, Anton V., Kel’manov, Alexander V., Kovalyov, Mikhail Y., Pyatkin, Artem V.

“… between them. We consider the computational complexity of both problems and propose exact dynamic programming algorithms in the case of integer input data …”
Volltext

Theoretical and practical issues in single-machine scheduling with two job release and delivery times von Reynoso, Alejandro, Vakhania, Nodari

“… We study a single-machine scheduling problem with two allowable job release and delivery times. This special case of a strongly NP-hard single-machine …”
Volltext

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

Supply chain scheduling with receiving deadlines and non-linear penalty von Wang, Gang, Lei, Lei, Lee, Kangbok

“… We study the operations scheduling problem with delivery deadlines in a three-stage supply chain process consisting of (1) heterogeneous suppliers, (2) …”
Volltext

Dynamic programming algorithms for producing food mixture packages by automatic combination weighers von Shinji IMAHORI, Yoshiyuki KARUNO, Kenju TATEISHI

“… The lexicographic bi-criteria combinatorial optimization problem to be discussed in this paper is a mathematical model of the food mixture packing performed by …”
Volltext

Pseudo-Polynomial Time Algorithms for Producing Cardinality Constrained Packages by Multi-Head Weighers von Karuno, Yoshiyuki, Nakahama, Oki

“… In this paper, an O(knt) time algorithm is presented to solve the subset selection problem. Numerical experiments are also conducted to demonstrate the performance of the pseudo-polynomial time algorithm on certain test instances having a feasible solution, and the results are reported …”
Volltext

Effective genetic algorithm for resource-constrained project scheduling with limited preemptions von Zhu, Jie, Li, Xiaoping, Shen, Weiming

“… –1 knapsack problem and solved by dynamic programming in pseudo-polynomial time complexity …”
Volltext

Static and dynamic source locations in undirected networks von Turner, Lara, Groß, Dwi Poetranto, Hamacher, Horst W., Krumke, Sven O.

“… ; for the simultaneous scenario with non-uniform costs, a pseudo-polynomial algorithm is proposed which can be turned into a fully …”
Volltext

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph von Yu, Chih-Chiang, Lin, Chien-Hsin, Wang, Biing-Feng

“… This paper is composed of two parts. In the first part, an improved algorithm is presented for the problem of finding length-bounded two vertex-disjoint paths in an undirected planar graph …”
Volltext