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

DOI10.1016/J.COMNET.2010.05.017zbMATH Open1210.68138OpenAlexW2052229697MaRDI QIDQ612751FDOQ612751

Rosario G. Garroppo, Luca Tavanti, Stefano Giordano

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

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

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)

Cited In (17)

• Hierarchical Multiobjective Shortest Path Problems
• 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
• Title not available (Why is that?)
• Non-additive shortest path in the context of traffic assignment
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Precomputation for multi-constrained QoS routing in GMPLS networks
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
• Network Models for Multiobjective Discrete Optimization
• Fast approximation algorithms for routing problems with hop-wise constraints
• New Routing Strategies for RSP Problems with Concave Cost
• 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)