CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL

DOI10.1080/03081079608945154zbMath0868.90040OpenAlexW1980159468MaRDI QIDQ4337491

Boris S. Veroy

Publication date: 19 May 1997

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079608945154

zbMATH Keywords

shortest pathperformance analysispolynomial algorithmconstraintdesign of communication networksnetwork capacity expansion

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Cites Work

• A note on two problems in connexion with graphs
• The equity constrained shortest path problem
• An efficient Dijkstra-like labeling method for computing shortest odd/even paths
• Shortest path under rational constraint
• Temporal constraint networks
• The shortest route problem with constraints
• Some Recent Advances in Network Flows
• Iterative methods for determining the k shortest paths in a network

This page was built for publication: CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL