Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem
From MaRDI portal
Recommendations
- On open shortest path first related network optimisation problems
- 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
- Optimization of OSPF routing in IP networks
- Increasing internet capacity using local search
Cited in
(5)- On open shortest path first related network optimisation problems
- Intra-domain traffic engineering with shortest path routing protocols
- Intra-domain traffic engineering with shortest path routing protocols
- An enhanced Benders decomposition method for unique shortest path routing
- On the extremal structure of an OSPF related cone
This page was built for publication: Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709482)