An integer programming algorithm for routing optimization in IP networks
From MaRDI portal
Publication:547285
DOI10.1007/S00453-009-9381-5zbMATH Open1216.90061OpenAlexW4248604969MaRDI QIDQ547285FDOQ547285
Authors: Andreas Bley 
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
Recommendations
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Optimization of OSPF routing in IP networks
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
- Increasing internet capacity using local search
- Optimization of Internet Protocol network design and routing
Cites Work
- A genetic algorithm for the weight setting problem in OSPF routing
- Title not available (Why is that?)
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Increasing internet capacity using local search
- Optimization of Internet Protocol network design and routing
- Approximability of unsplittable shortest path routing problems
- Polyhedral results for the precedence-constrained knapsack problem
- Lifting valid inequalities for the precedence constrained knapsack problem
- Routing and capacity optimization for IP networks
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Design of mixed MPLS/OSPF routing in IP networks
- 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
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Title not available (Why is that?)
- Integer linear programming models for global routing
- Constrained rerouting in networks: an integer programming formulation
- An integer programming approach to routing in daisy networks
- Integer programming approach to the data traffic paths recovering problem
- Fine two-phase routing over shortest paths with traffic matrix
- Routing and capacity optimization for IP networks
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
Uses Software
This page was built for publication: An integer programming algorithm for routing optimization in IP networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547285)
