An Integer Programming Algorithm for Routing Optimization in IP Networks
Author:
- 1 January 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 60 (1) , 21-45
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimization of OSPF Routing in IP Networks2009
- Approximability of unsplittable shortest path routing problemsNetworks, 2009
- Valid cycles: A source of infeasibility in open shortest path first routingNetworks, 2008
- Routing and Capacity Optimization for IP Networks2008
- Integer Programming Approaches to Access and Backbone IP Network Planning2008
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest pathsNetworks, 2007
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routingNetworks, 2005
- Internet Routing and Related Topology IssuesSIAM Journal on Discrete Mathematics, 2003
- Polyhedral results for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1993
- Use of OSI IS-IS for routing in TCP/IP and dual environments1990