Výsledky vyhľadávania - "new dynamic programming algorithms"

New dynamic programming algorithms for the resource constrained elementary shortest path problem

Autori: Levin, A. Paulusma, Daniel Woeginger, G.J. a ďalší

Prispievatelia: Levin, A. Paulusma, Daniel Woeginger, G.J. a ďalší

Zdroj: Networks. 51:155-170

Predmety: Edge contraction, Computational complexity, Dominating vertex, 0202 electrical engineering, electronic engineering, information engineering, 0211 other engineering and technologies, Shortest path, Vehicle routing, Column generation, Dynamic programming, Branch-and-bound, 0102 computer and information sciences, 02 engineering and technology, 0101 mathematics, 01 natural sciences, Graph

Prístupová URL adresa: https://air.unimi.it/bitstream/2434/5590/2/rcespp2.pdf
http://sxs.sxu.edu.cn/docs/20081212202329468499.pdf
https://dblp.uni-trier.de/db/journals/networks/networks51.html#LaiC08
https://www.onlinelibrary.wiley.com/doi/abs/10.1002/net.20213
https://infoscience.epfl.ch/record/117069
https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.20217
http://sxs.sxu.edu.cn/docs/20081212202329468499.pdf
https://dblp.uni-trier.de/db/journals/networks/networks51.html#WangL08
https://dl.acm.org/doi/10.5555/1364807.1364808
https://dblp.uni-trier.de/db/journals/networks/networks51.html#Baveja08
https://onlinelibrary.wiley.com/doi/abs/10.1002/net.20216

New dynamic programming algorithms for the resource-constrained elementary shortest path problem

Autori: Giovanni Righini Matteo Salani G. Righini a ďalší

Prispievatelia: Giovanni Righini Matteo Salani G. Righini a ďalší

Predmety: Settore MAT/09 - Ricerca Operativa

Relation: ispartofseries:Note del Polo - Ricerca; 69; https://hdl.handle.net/2434/5590

Dostupnosť: https://hdl.handle.net/2434/5590

New dynamic programming algorithms for the resource constrained shortest path problem

Autori: Righini, Giovanni Salani, Matteo

Predmety: shortest path, vehicle routing, column generation, dynamic programming, branch-and-bound

Relation: https://infoscience.epfl.ch/handle/20.500.14299/233749

Dostupnosť: https://infoscience.epfl.ch/handle/20.500.14299/233749
https://hdl.handle.net/20.500.14299/233749

New dynamic programming algorithms for the resource constrained elementary shortest path problem.

Autori: Righini, Giovanni Salani, Matteo

Zdroj: Networks; May2008, Vol. 51 Issue 3, p155-170, 16p

Rapid dynamic programming algorithms for RNA secondary structure

Autori: Michael S. Waterman Temple F. Smith

Zdroj: Advances in Applied Mathematics. 7:455-464

Predmety: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, Analysis of algorithms and problem complexity, Prediction of RNA secondary structure, new dynamic programming algorithms, Applied Mathematics, Physiological, cellular and medical topics, biochemistry, polynomial time algorithm, Dynamic programming, linear RNA sequence

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3982976
https://doi.org/10.1016/0196-8858(86)90025-4
https://www.sciencedirect.com/science/article/pii/0196885886900254
https://dornsife.usc.edu/assets/sites/516/docs/papers/msw_papers/msw-075.pdf
http://dornsife.usc.edu/assets/sites/516/docs/papers/msw_papers/msw-075.pdf
https://www.sciencedirect.com/science/article/abs/pii/0196885886900254
https://core.ac.uk/display/82170261

The development of an efficient scheduling heuristic for multi-robot pick-and-place operations.

Autori: Teck, Sander Engelen, Bart Peeters, Jef a ďalší

Zdroj: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8923-8942, 20p

A Vehicle Routing Problem Based on a Long-Distance Transportation Network with an Exact Optimization Algorithm.

Autori: Emre, Toygar Erol, Rızvan

Zdroj: Mathematics (2227-7390); Nov2025, Vol. 13 Issue 21, p3397, 40p

Predmety: VEHICLE routing problem, TRANSPORTATION costs, FREIGHT & freightage, LOGISTICS, COLUMN generation (Algorithms), TRUCKLOAD shipping, OPTIMIZATION algorithms

Geografický termín: UNITED States

A Note on "Flowshop Scheduling with Learning Effectand Job Rejection".

Autori: Yu, Jin Liu, Pei-Hai Lu, Xi-Wen

Zdroj: Journal of the Operations Research Society of China; Jun2025, Vol. 13 Issue 2, p452-462, 11p

Branch-Price-and-Cut for the Electric Vehicle Routing Problem with Heterogeneous Recharging Technologies and Nonlinear Recharging Functions.

Autori: Nafstad, Gaute Messel Desaulniers, Guy Stålhane, Magnus

Zdroj: Transportation Science; May/Jun2025, Vol. 59 Issue 3, p628-646, 19p

Predmety: VEHICLE routing problem, ELECTRIC vehicle industry, ALGORITHMS, SCHEDULING, NUMERICAL calculations, INTEGER programming

A DYNAMIC PROGRAMMING APPROACH FOR A CLASS OF ROBUST OPTIMIZATION PROBLEMS.

Autori: AGRA, AGOSTINHO SANTOS, MARCIO COSTA NACE, DRITAN a ďalší

Zdroj: SIAM Journal on Optimization; 2016, Vol. 26 Issue 3, p1799-1823, 25p

Predmety: DYNAMIC programming, ROBUST optimization, MIXED integer linear programming, POLYTOPES, DEVIATION (Statistics)

A Column-Generation-Based Exact Algorithm to Solve the Full-Truckload Vehicle-Routing Problem.

Autori: Emre, Toygar Erol, Rizvan

Zdroj: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 5, p876, 32p

Predmety: COLUMN generation (Algorithms), COLUMNS, ROUTING algorithms, CONSUMERS, LOADING & unloading, TRAILERS

Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows.

Autori: Duman, Ece Naz Taş, Duygu Çatay, Bülent

Zdroj: International Journal of Production Research; Sep2022, Vol. 60 Issue 17, p5332-5353, 22p, 3 Diagrams, 16 Charts

Predmety: VEHICLE routing problem, COLUMN generation (Algorithms), HEURISTIC algorithms, INTEGER programming, COLUMNS, ELECTRIC vehicles

On the generalized constrained longest common subsequence problems.

Autori: Chen, Yi-Ching Chao, Kun-Mao

Zdroj: Journal of Combinatorial Optimization; Apr2011, Vol. 21 Issue 3, p383-392, 10p, 2 Diagrams, 1 Chart

A Branch-and-Price-and-Cut Algorithm for the Inland Container Transportation Problem with Limited Depot Capacity.

Autori: Song, Yujian Zhang, Yuting

Zdroj: Applied Sciences (2076-3417); Dec2024, Vol. 14 Issue 24, p11958, 34p

Predmety: CONTAINERIZATION, LINEAR programming, TIME perspective, TERMINALS (Transportation), SENSITIVITY analysis

An updated survey of attended home delivery and service problems with a focus on applications.

Autori: Cordeau, Jean-François Iori, Manuel Vezzali, Dario

Zdroj: Annals of Operations Research; Dec2024, Vol. 343 Issue 2, p885-922, 38p

Predmety: COVID-19 pandemic, CONSUMERS, ELECTRONIC commerce, HABIT

Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques.

Autori: Sylejmani, Kadri Abdurrahmani, Vigan Ahmeti, Arben a ďalší

Zdroj: Information Technology & Tourism; Dec2024, Vol. 26 Issue 4, p633-678, 46p

Predmety: TRAVEL costs, BUDGET, ORIENTEERING, TOURISTS, ORIENTEERS

Modeling and Optimization of the Inland Container Transportation Problem Considering Multi-Size Containers, Fuel Consumption, and Carbon Emissions.

Autori: Song, Yujian Zhang, Yuting

Zdroj: Processes; Oct2024, Vol. 12 Issue 10, p2231, 32p

Predmety: CONTAINERIZATION, SUSTAINABILITY, GENETIC algorithms, CARBON emissions, TECHNOLOGICAL innovations, TABU search algorithm, TRANSPORTATION costs

Bilevel interactive optimisation for rebatching scheduling problem with selectivity banks in high variety flow line production.

Autori: Chen, Wenchong Gong, Xuejian Liu, Fangyu a ďalší

Zdroj: International Journal of Production Research; Jun2022, Vol. 60 Issue 12, p3879-3900, 22p, 8 Diagrams, 9 Charts, 3 Graphs

Predmety: BILEVEL programming, AUTOMOTIVE painting & paint shops, MASS customization, DYNAMIC programming, GENETIC algorithms

Dynamic programming algorithms for the Zero-One Knapsack Problem.

Alternate Title: Algorithmen der dynamischen Optimierung für das 0-1-Knapsack-Problem. (German)

Autori: Toth, P.

Zdroj: Computing; 1980, Vol. 25 Issue 1, p29-45, 17p

Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone.

Autori: Blufstein, Marcos Lera-Romero, Gonzalo Soulignac, Francisco J.

Zdroj: INFORMS Journal on Computing; Jul/Aug2024, Vol. 36 Issue 4, p1064-1083, 20p

Predmety: TRAVELING salesman problem, DELIVERY of goods, DYNAMIC programming, CONSUMERS, ALGORITHMS