Graceful reassignment of excessively long communications paths in networks

DOI10.1016/j.ejor.2003.08.035zbMath1067.90017OpenAlexW2044463963MaRDI QIDQ1887906

Richard T. Wong, Hanan Luss

Publication date: 22 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.035

zbMATH Keywords

HeuristicsRoutingTelecommunicationsNetwork flowsIP networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• ATM network design: Traffic models and optimization-based heuristics
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• A Minimum Delay Routing Algorithm Using Distributed Computation
• ATM layouts with bounded hop count and congestion
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Graceful reassignment of excessively long communications paths in networks