Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints (Q3418123)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints |
scientific article |
Statements
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints (English)
0 references
2 February 2007
0 references
minimum cost capacity reservation IP networks OSPF protocol neighborhood search
0 references
