Multiple Routing Strategies in a Labelled Network

DOI10.1051/ro:2001104zbMath0993.90015OpenAlexW2072608879MaRDI QIDQ2765602

Alain Quilliot, D. Peyrton, J. Maublanc

Publication date: 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_85_0

zbMATH Keywords

shortest pathsnetwork designrouting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A retraction problem in graph theory
• Parametric shortest path algorithms with an application to cyclic staffing
• Methods and problems of communication in usual networks
• On algorithms for finding the k shortest paths in a network
• Réseaux stochastiques
• Nonlinear cost network models in transportation analysis
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Minimum-time line broadcast networks
• Exact and approximate algorithms for optimal network design
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Minimum cost routing for dynamic network models

This page was built for publication: Multiple Routing Strategies in a Labelled Network