Algorithms for finding paths with multiple constraints

DOI10.1002/NET.3230140109MaRDI QIDQ3315013zbMATH OpenOpenAlexFDO

Authors Jeffrey M. Jaffe

Publication date 1984

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230140109

zbMATH Keywords

weighted graphpaths with multiple constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• Algorithms for the weight constrained shortest path problem
• The exact path length problem.
• A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
• scientific article; zbMATH DE number 1445588
• On paths with the shortest average arc length in weighted graphs

Cited in

(36)

• Algorithms – ESA 2005
• Nodal aggregation of resource constraints in a shortest path problem
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• Algorithms for the weight constrained shortest path problem
• Dynamic programming and suboptimal control: a survey from ADP to MPC
• Range-constrained traffic assignment with multi-modal recharge for electric vehicles
• Approximation algorithms for multi-parameter graph optimization problems
• Simple paths with exact and forbidden lengths
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• scientific article; zbMATH DE number 4073013 (Why is no real title available?)
• Route selection with multiple metrics
• scientific article; zbMATH DE number 1791938 (Why is no real title available?)
• Complexity results on labeled shortest path problems from wireless routing metrics
• Operator calculus algorithms for multi-constrained paths
• On the complexity of quality of service routing
• scientific article; zbMATH DE number 970006 (Why is no real title available?)
• Neural and delay based heuristics for the Steiner problem in networks
• A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks
• On the quickest path problem
• scientific article; zbMATH DE number 7455732 (Why is no real title available?)
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
• Length-constrained path-matchings in graphs
• Routing with critical paths
• Path Problems in Complex Networks
• The asymmetric traveling salesman problem with replenishment arcs
• A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
• Walking through waypoints
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• A penalty function heuristic for the resource constrained shortest path problem
• Finding cheapest deadline paths
• Multi-postpath-based lookahead multiconstraint QoS routing
• Finding Multi-Constrained Multiple Shortest Paths
• Optimal control with budget constraints and resets
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
• 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

This page was built for publication: Algorithms for finding paths with multiple constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315013)