An integer programming algorithm for routing optimization in IP networks
From MaRDI portal
Publication:547285
DOI10.1007/s00453-009-9381-5zbMath1216.90061OpenAlexW4248604969MaRDI QIDQ547285
Publication date: 1 July 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9381-5
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Increasing internet capacity using local search
- Polyhedral results for the precedence-constrained knapsack problem
- A genetic algorithm for the weight setting problem in OSPF routing
- Lifting valid inequalities for the precedence constrained knapsack problem
- Approximability of unsplittable shortest path routing problems
- Optimization of OSPF Routing in IP Networks
- Valid cycles: A source of infeasibility in open shortest path first routing
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- Internet Routing and Related Topology Issues
- Optimization of Internet Protocol network design and routing
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Routing and Capacity Optimization for IP Networks
This page was built for publication: An integer programming algorithm for routing optimization in IP networks