On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
From MaRDI portal
Publication:5214308
DOI10.1051/ro/2018072zbMath1430.90561OpenAlexW2889742121WikidataQ129326246 ScholiaQ129326246MaRDI QIDQ5214308
Natã Goulart, Thiago F. Noronha, Sérgio Ricardo de Souza, Daniel Morais dos Reis
Publication date: 7 February 2020
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018072
iterated local searchrouting and wavelength assignmentheuristics and metaheuristicsoptical network optimization
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Routing and wavelength assignment by partition colouring
- 0-1 reformulations of the multicommodity capacitated network design problem
- Minimum cost capacity installation for multicommodity network flows
- Probability distribution of solution time in GRASP: an experimental investigation
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- TTT plots: a perl program to create time-to-target plots
- Metric inequalities and the network loading problem
- A survey of local search methods for graph coloring
- A branch-and-cut algorithm for partition coloring
- The Number of k-Coloured Graphs on Labelled Nodes
- Mersenne twister
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem