Constrained rerouting in networks: an integer programming formulation

MaRDI QIDQ3110084zbMATH OpenFDO

Authors

Publication date 26 January 2012

zbMATH Keywords

computationally feasible methodinfeasibility analysislink weights

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10)

Recommendations

• On open shortest path first related network optimisation problems
• Increasing internet capacity using local search
• An integer programming algorithm for routing optimization in IP networks
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• Optimization of OSPF routing in IP networks

Cited in

(5)

• On the solution of reroute sequence planning problem in MPLS networks.
• Mixed integer formulations for a routing problem with information collection in wireless networks
• Integer linear programming models for global routing
• Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design

This page was built for publication: Constrained rerouting in networks: an integer programming formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110084)