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

DOI10.1016/j.comnet.2010.05.017zbMath1210.68138OpenAlexW2052229697MaRDI QIDQ612751

Luca Tavanti, Stefano Giordano, Rosario Giuseppe 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

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

Related Items (14)

Scheduling lower bounds via AND subset sum ⋮ Generalized zeon algebras: theory and application to multi-constrained path problems ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Fast approximation algorithms for routing problems with hop-wise constraints ⋮ Multi-criteria approximation schemes for the resource constrained shortest path problem ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ Hierarchical Multiobjective Shortest Path Problems ⋮ A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria ⋮ Unnamed Item

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