Výsledky vyhľadávania - pseudo-polynomial (dynamic OR dynamika) programming algorithms

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

“… We develop pseudo-polynomial algorithms to solve this new constrained version in the cases where the dependencies…”
Získať plný text

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem Autor 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…”
Získať plný text

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

“…•New mathematical models for the Capacitated Vehicle Routing Problem.•Lower bounds computable in pseudo-polynomial time…”
Získať plný text

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

“… We give the first pseudo-polynomial time constant approximation algorithm for this problem…”
Získať plný text

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

“…► The paper rescues dynamic programming for solving the capacitor allocation problem…”
Získať plný text

Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling Autor 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…”
Získať plný text

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

“…•A pseudo-polynomial algorithm to solve the two-product capacitated dynamic lot-sizing problem is proposed…”
Získať plný text

Arc flow formulations based on dynamic programming: Theoretical foundations and applications Autor 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…”
Získať plný text

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

“…•The Multiple Knapsack Problem is studied.•New pseudo-polynomial formulations for the problem are described…”
Získať plný text

Single-machine scheduling of multiple projects with controllable processing times Autor 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…”
Získať plný text

Multitasking scheduling with alternate periods Autor 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…”
Získať plný text

Selecting a subset of diverse points based on the squared euclidean distance Autor 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…”
Získať plný text

Theoretical and practical issues in single-machine scheduling with two job release and delivery times Autor 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…”
Získať plný text

Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach Autor 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…”
Získať plný text

Supply chain scheduling with receiving deadlines and non-linear penalty Autor 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)…”
Získať plný text

Dynamic programming algorithms for producing food mixture packages by automatic combination weighers Autor 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…”
Získať plný text

Pseudo-Polynomial Time Algorithms for Producing Cardinality Constrained Packages by Multi-Head Weighers Autor 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…”
Získať plný text

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

“…–1 knapsack problem and solved by dynamic programming in pseudo-polynomial time complexity…”
Získať plný text

Static and dynamic source locations in undirected networks Autor 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…”
Získať plný text

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 Autor 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…”
Získať plný text