| Keyword | Description |
|---|---|
| Ant Colony Optimization (ACO) | An example where a heuristic using an ant colony optimization (ACO) algorithmic approach is used |
| Bandwidth assignment (BA) | An example where the volume of traffic to be carried by each demand, is an algorithm output. |
| Capacity assignment (CA) | An example where the capacities in the links are algorithm outputs. |
| Convex formulation | An example where a non-linear convex formulation is solved using a solver. |
| Destination-based routing | An example related to a problem where the traffic routing is destination-based (i.e. like in IP) |
| Evolutionary algorithm (EA) | An example where a heuristic using an evolutionary algorithm approach is used |
| Flow assignment (FA) | An example where the routing of the traffic is an algorithm output. |
| Greedy heuristic | An example where a heuristic using a greedy approach is used |
| Greedy-Randomized Adaptive Search Procedure (GRASP) | An example where a heuristic using a Greedy-Randomized Adaptive Search Procedure (GRASP) algorithmic approach is used |
| JOM | An example where the Java Optimization Modeler (JOM) library is used |
| Local search (LS) heuristic | An example where a heuristic using a local search approach is used |
| LP formulation | An example where a Linear Programming (LP) formulation is solved using a solver. |
| MILP formulation | An example where a Mixed Integer Linear Programming (MILP) formulation is solved using a solver. |
| MPLS | An example where the network is assumed to be composed of MPLS nodes (LSRs), demands are MPLS virtual circuits (LSPs). |
| Multilayer | An example where a multilayer representation of a network model is used |
| OSPF | An example where routing is based on the Open Shortest Path First (OSPF) protocol |
| Projected gradient/subgradient algorithm | An example where an iterative algorithm based on the projected gradient/subgradient scheme is used |
| Protection algorithm | An example where traffic is protected using backup segments. |
| Regenerator placement | An example which deals with the regenerator placement problem |
| Restoration algorithm | An example where restoration actions are planned reacting to network failures. |
| Simulated annealing (SAN) | An example where a heuristic using a simulated annealing approach is used |
| Tabu search (TS) | An example where a heuristic using a tabu search approach is used |
| Topology assignment (TA) | An example where the links and/or nodes in the network, are algorithm outputs. |
| WDM | An example where Wavelength Division Multiplexing (WDM) technology is used |
The open-source network planner
