A dual algorithm for the constrained shortest path problem
From MaRDI portal
Publication:3901004
Cited in
(66)- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- The impact of distance on location problems
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Multiobjective routing problems
- Air cargo scheduling: integrated models and solution procedures
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
- Finding the nucleolus of the vehicle routing game with time windows
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Feeder routing for air-to-air refueling operations
- The pyramidal capacitated vehicle routing problem
- Lagrangian relaxation for the multiple constrained robust shortest path problem
- The electric vehicle shortest-walk problem with battery exchanges
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Algorithms for non-linear and stochastic resource constrained shortest path
- Cost-based filtering for shorter path constraints
- An optimal algorithm for the obstacle neutralization problem
- The structural complexity landscape of finding balance-fair shortest paths
- Finding cheapest deadline paths
- A survey of resource constrained shortest path problems: exact solution approaches
- Path Problems in Complex Networks
- A penalty search algorithm for the obstacle neutralization problem
- On an exact method for the constrained shortest path problem
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- Solving resource constrained shortest path problems with LP-based methods
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
- Effective algorithms for a class of discrete valued optimal control problems
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Optimal network design with end-to-end service requirements
- Acceleration strategies for the weight constrained shortest path problem with replenishment
- The resource constrained shortest path problem implemented in a lazy functional language
- Fast approximation algorithms for routing problems with hop-wise constraints
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Computational complexity of convoy movement planning problems
- Constrained shortest path with uncertain transit times
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- An efficient exact approach for the constrained shortest path tour problem
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
- P-median problems with an additional constraint on the assignment variables
- Routing of electric vehicles: constrained shortest path problems with resource recovering nodes
- Bicriteria data compression
- Solving the constrained shortest path problem using random search strategy
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- Upgrading edges in the graphical TSP
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
- Enhanced methods for the weight constrained shortest path problem
- Collaborative optimization of routing and storage strategy of multi-period multimodal transport in an uncertain environment
- Generating price-effective intermodal routes
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- Complexity analysis and optimization of the shortest path tour problem
- An upper bound on the number of extreme shortest paths in arbitrary dimensions
- An optimal absolute approximation algorithm for computing k restricted shortest paths
- Optimizing the transport of organs for transplantation
- Capturing the dilution effect of risk-based grouping with application to COVID-19 screening
- Approximate multi-objective search
- A fast and simple algorithm for the resource constrained shortest path problem
- Navigating network availability: a shortest path approach to UAV traffic routing
- Fair short paths in vertex-colored graphs
- Solving k-shortest and constrained shortest path problems efficiently
- Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations
- Mathematical models and solution methods for optimal container terminal yard layouts
This page was built for publication: A dual algorithm for the constrained shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901004)
