• Home
  • Search
  • Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem
  • Open Access IconOpen Access
  • Cite Icon1
  • https://doi.org/10.1016/j.trpro.2024.02.046Copy DOI Icon

Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem

Similar Papers
  • Research Article
  • Citations24

The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach

  • Mar 26, 2019
  • Computers & Operations Research
  • Luigi Di Puglia Pugliese +2
  • Book Chapter
  • Citations48

Cost-Based Filtering for Shorter Path Constraints

  • Jan 01, 2003
  • Meinolf Sellmann
  • Conference Article
  • Citations4

On the Shortest Path Problems with Edge Constraints

  • Jul 01, 2020
  • Daniele Ferone +3
  • Research Article
  • Citations325

An algorithm for the resource constrained shortest path problem

  • Jul 01, 1989
  • Networks
  • J E Beasley +1
  • Conference Article
  • Citations5

Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection

  • Sep 08, 2008
  • Proceedings
  • M.I.J Van Dijke +2
  • Research Article

The resource constrained shortest path problem implemented in a lazy functional language

  • Jan 01, 1996
  • Journal of Functional Programming
  • Pieter H Hartel +1
  • Research Article
  • Citations29

Partial and complete replanning of an intermodal logistic system under disruptions

  • Nov 29, 2022
  • Transportation Research Part E: Logistics and Transportation Review
  • M Hakan Akyüz +2
  • Research Article
  • Citations21

Resource Constrained Shortest Path Problems in Path Planning for Fleet Management

  • Mar 01, 2004
  • Journal of Mathematical Modelling and Algorithms
  • Pasquale Avella +2
  • Research Article
  • Citations2

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem

  • Oct 28, 2014
  • Algorithmica
  • Matthew Williamson +2
  • PDF
  • Research Article
  • Citations9

A Deep Learning Approach to Lunar Rover Global Path Planning Using Environmental Constraints and the Rover Internal Resource Status

  • Jan 28, 2024
  • Sensors (Basel, Switzerland)
  • Toshiki Tanaka +1
  • Research Article
  • Citations3

On the negative cost girth problem in planar networks

  • Oct 08, 2015
  • Journal of Discrete Algorithms
  • Matthew Williamson +1
  • Conference Article
  • Citations1

Electric Vehicle Travel Planning with Lazy Evaluation of Recharging Times

  • Oct 01, 2019
  • Marek Cuchy +1
  • Research Article
  • Citations3

A general purpose exact solution method for mixed integer concave minimization problems

  • Feb 10, 2023
  • European Journal of Operational Research
  • Ankur Sinha +3
  • Research Article

Optimizing the Performance of Quadratic Search using Memorization

  • Apr 30, 2017
  • International Journal of Advanced Research in Computer Science
  • Deepti Verma +1
  • Research Article
  • Citations7

A multiphase dynamic programming algorithm for the shortest path problem with resource constraints

  • Dec 01, 2023
  • European Journal of Operational Research
  • Ilyas Himmich +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.