An integer programming algorithm for routing optimization in IP networks
From MaRDI portal
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
- scientific article; zbMATH DE number 1532269 (Why is no real title available?)
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- A genetic algorithm for the weight setting problem in OSPF routing
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Approximability of unsplittable shortest path routing problems
- Design of mixed MPLS/OSPF routing in IP networks
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- Increasing internet capacity using local search
- Internet Routing and Related Topology Issues
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Lifting valid inequalities for the precedence constrained knapsack problem
- Optimization of Internet Protocol network design and routing
- Optimization of OSPF routing in IP networks
- Polyhedral results for the precedence-constrained knapsack problem
- Routing and capacity optimization for IP networks
- Valid cycles: A source of infeasibility in open shortest path first routing
Cited in
(11)- An integer programming approach to routing in daisy networks
- scientific article; zbMATH DE number 2112441 (Why is no real title available?)
- Integer programming approach to the data traffic paths recovering problem
- On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
- Fine two-phase routing over shortest paths with traffic matrix
- scientific article; zbMATH DE number 1981018 (Why is no real title available?)
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- Routing and capacity optimization for IP networks
- Constrained rerouting in networks: an integer programming formulation
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Integer linear programming models for global routing
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)
