Algorithms for finding paths with multiple constraints
From MaRDI portal
Publication:3315013
DOI10.1002/net.3230140109zbMath0532.68068OpenAlexW2127456145MaRDI QIDQ3315013
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140109
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (22)
Route selection with multiple metrics ⋮ On the complexity of quality of service routing ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ Path Problems in Complex Networks ⋮ Multi-postpath-based lookahead multiconstraint QoS routing ⋮ Finding cheapest deadline paths ⋮ Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ On the quickest path problem ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ The asymmetric traveling salesman problem with replenishment arcs ⋮ Neural and delay based heuristics for the Steiner problem in networks ⋮ Optimal Control with Budget Constraints and Resets ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ Approximation algorithms for multi-parameter graph optimization problems
Cites Work
This page was built for publication: Algorithms for finding paths with multiple constraints
