Integer Programming Approaches to Access and Backbone IP Network Planning
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 87-110
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- 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
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing ProblemLecture Notes in Computer Science, 2005
- Increasing Internet Capacity Using Local SearchComputational Optimization and Applications, 2004
- Internet Routing and Related Topology IssuesSIAM Journal on Discrete Mathematics, 2003
- NetScope: traffic engineering for IP networksIEEE Network, 2000
- On the Two-Level Uncapacitated Facility Location ProblemINFORMS Journal on Computing, 1996
- Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree ProblemINFORMS Journal on Computing, 1996
- Polyhedral results for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1993
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978