Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints

DOI10.1002/net.20142zbMath1131.90320OpenAlexW4246431710MaRDI QIDQ3418123

No author found.

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20142

zbMATH Keywords

minimum cost capacity reservation IP networks OSPF protocol neighborhood search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints