An example where a heuristic using an ant colony optimization (ACO) algorithmic approach is used

An example where the traffic routing is performed using a backpressure approach.

An example where the volume of traffic to be carried by each demand, is an algorithm output (that includes congestion control algorithms).

An example where an algorithm performing the admission control to incoming connection requests is involved.

An example where the wireless links are coordinated using a CSMA MAC.

An example where the capacities in the links are algorithm outputs.

An example related to a problem where the traffic routing is destination-based (i.e. like in IP)

An example where a destination-link formulation of the routing is involved.

An example where a distributed algorithm (different agents operating more or less independently, coordinated by an implicit or explicit signaling) is involved.

An example where an algorithm based on a dual decomposition of the problem is used.

An example where a gradient or subgradient algorithm optimizing the dual function is used.

An example where a heuristic using an evolutionary algorithm approach is used

An example where the routing of the traffic is an algorithm output.

An example where a flow-link formulation of the routing is involved.

An example where a flow-path formulation of the routing is involved.

An example where a heuristic using a Greedy-Randomized Adaptive Search Procedure (GRASP) algorithmic approach is used

An example where a heuristic using a greedy approach is used

An example where routing is based on the Open Shortest Path First (OSPF) protocol

An example where the Java Optimization Modeler (JOM) library is used to solve a formulation

An example where a heuristic using a local search approach is used

An example where link capacities are restricted to a discrete set of possible values

An example where multicast traffic is involved

An example where the network is composed of different domains or autonomous systems, controlled by different organizations

An example where traffic variations typical of multihour profiles (e.g. predictable day-night fluctuations in the traffic, or time-zone based traffic variations) are considered in the optimization

An example where a multilayer representation of a network model is used

An example where multiple time periods are considered in the network optimization (e.g. successive years with different traffics and equipment costs)

An example in the context of Network Function Virtualizatin (NFV)

An example where a Network Utility Maximization (NUM) model is used

An example where traffic is protected using backup segments.

An example where traffic is recovered using restoration.

An example where an algorithm based on a primal decomposition of the problem is used.

An example where a gradient or subgradient algorithm optimizing the primal problem objective function is used.

An example where wireless links are coordinated by a random-access MAC, based on persistence probabilities.

An example where a heuristic using a simulated annealing approach is used

An example where the Transmission Control Protocol (TCP) is involved

An example where a heuristic using a tabu search approach is used

An example where the links and/or nodes in the network, are algorithm outputs.

An example where the links are wireless links, and its transmission power is optimized.

An example where Wavelength Division Multiplexing (WDM) technology is used

An example focused on the design of a wireless network