A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
From MaRDI portal
Publication:2691338
DOI10.3934/jimo.2022097OpenAlexW4285115911MaRDI QIDQ2691338
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022097
Analysis of algorithms (68W40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Cites Work
- On an exact method for the constrained shortest path problem
- Minimum cost path problems with relays
- The network design problem with relays
- Branch-and-price approaches for the network design problem with relays
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Solving shortest path problems with a weight constraint and replenishment arcs
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- Resource extension functions: properties, inversion, and generalization to segments
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An exact bidirectionalA⋆approach for solving resource-constrained shortest path problems
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Author's reply
- An efficient exact approach for the constrained shortest path tour problem
- Graph-Theoretic Concepts in Computer Science
- An exact bidirectional pulse algorithm for the constrained shortest path
This page was built for publication: A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
