scientific article; zbMATH DE number 1347106

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199909)34:2<136::AID-NET7>3.0.CO;2-6" /><136::AID-NET7>3.0.CO;2-6 10.1002/(SICI)1097-0037(199909)34:2<136::AID-NET7>3.0.CO;2-6zbMath0959.90068MaRDI QIDQ4267395

Weizhen Mao, Jessen T. Havill

Publication date: 4 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

networkgreedy online algorithmsrouting permanent virtual circuits

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum concurrent flow problem
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: