A survey on multi-constrained optimal path computation: exact and approximate algorithms

DOI10.1016/J.COMNET.2010.05.017MaRDI QIDQ612751zbMATH OpenOpenAlexFDO

Authors Stefano Giordano, Luca Tavanti, Rosario G. Garroppo

Publication date 29 December 2010

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2010.05.017

zbMATH Keywords

exact algorithmsapproximate algorithmsmulti-constrained optimal path (MCOP)multi-constrained path (MCP)multi-objective optimal path (MOOP)quality of service (QoS) routingrestricted shortest path (RSP)

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Operator calculus algorithms for multi-constrained paths
• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
• Efficient QoS routing.
• On the complexity of quality of service routing
• New Routing Strategies for RSP Problems with Concave Cost

Cited in

(20)

• Generalized zeon algebras: theory and application to multi-constrained path problems
• Single machine scheduling with two competing agents and equal job processing times
• Scheduling lower bounds via AND subset sum
• Non-additive shortest path in the context of traffic assignment
• Operator calculus algorithms for multi-constrained paths
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Precomputation for multi-constrained QoS routing in GMPLS networks
• A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Scheduling lower bounds via and subset sum
• Network Models for Multiobjective Discrete Optimization
• Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
• Fast approximation algorithms for routing problems with hop-wise constraints
• Hierarchical multiobjective shortest path problems
• New Routing Strategies for RSP Problems with Concave Cost
• On time-travel planning in dynamic graphs
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• Bi-criteria path problem with minimum length and maximum survival probability
• Speeding up Martins' algorithm for multiple objective shortest path problems

This page was built for publication: A survey on multi-constrained optimal path computation: exact and approximate algorithms

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