The shortest route problem with constraints
From MaRDI portal
Publication:2521003
DOI10.1016/0022-247X(66)90020-5zbMath0135.20506OpenAlexW2058479406MaRDI QIDQ2521003
Publication date: 1966
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(66)90020-5
Related Items (37)
Stochastic Shortest Path Problem with Delay Excess Penalty ⋮ Knapsack problem with objective value gaps ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Weighting factor extensions for finite multiple objective vector minimization problems ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ 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 ⋮ The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ Simple paths with exact and forbidden lengths ⋮ Generalized Fibonacci maximum path graphs ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL ⋮ Algorithmic expedients for the prize collecting Steiner tree problem ⋮ Acceleration strategies for the weight constrained shortest path problem with replenishment ⋮ Cost-based filtering for shorter path constraints ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Maximum probability shortest path problem ⋮ Constrained shortest path with uncertain transit times ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures ⋮ Detecting highly oscillatory signals by chirplet path pursuit ⋮ The electric location routing problem with time windows and partial recharging ⋮ A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ Effective Algorithms for a Class of Discrete Valued Optimal Control Problems ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ A new model for path planning with interval data ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ Two engineering applications of a constrained shortest-path model ⋮ On Accuracy of Approximation for the Resource Constrained Shortest Path Problem ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ A heuristic approach to hard constrained shortest path problems ⋮ Approximation algorithms for multi-parameter graph optimization problems
Cites Work
This page was built for publication: The shortest route problem with constraints
