On a bi-dimensional dynamic alternative routing method

DOI10.1016/j.ejor.2004.03.047zbMath1112.90311OpenAlexW2067828993MaRDI QIDQ555940

Lúcia Martins, Teresa Gomes, Joao Carlos Namorado Climaco, José F. Craveirinha

Publication date: 10 June 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/4062

zbMATH Keywords

HeuristicsRoutingBi-criteria analysisTelecommunications

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution ⋮ A new multiobjective dynamic routing method for multiservice networks: modelling and performance

Cites Work

• Unnamed Item
• Unnamed Item
• A bicriterion shortest path algorithm
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• Dynamic Routing in Fully Connected Networks
• Blocking probabilities in large circuit-switched networks
• Routing in circuit-switched networks: optimization, shadow prices and decentralization
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Routing and Capacity Allocation in Networks with Trunk Reservation

This page was built for publication: On a bi-dimensional dynamic alternative routing method