Routing and wavelength assignment by partition colouring
From MaRDI portal
Publication:819072
DOI10.1016/j.ejor.2004.09.007zbMath1116.90073OpenAlexW1984237147MaRDI QIDQ819072
Thiago F. Noronha, Celso Carneiro Ribeiro
Publication date: 22 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.007
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks ⋮ On the minimum and maximum selective graph coloring problems in some graph classes ⋮ Lagrangean decomposition/relaxation for the routing and wavelength assignment problem ⋮ Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem ⋮ Solving routing and wavelength assignment problem with maximum edge-disjoint paths ⋮ On some applications of the selective graph coloring problem ⋮ Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem ⋮ A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks ⋮ Stochastic RWA and Lightpath Rerouting in WDM Networks ⋮ Routing and wavelength assignment in optical networks using bin packing based algorithms ⋮ An exact algorithm for the partition coloring problem ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ Extending time‐to‐target plots to multiple instances ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands ⋮ Variable neighborhood descent with iterated local search for routing and wavelength assignment ⋮ \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms ⋮ A branch-and-price approach for the partition coloring problem ⋮ A branch-and-cut algorithm for partition coloring ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ Perfectness of clustered graphs ⋮ A note on selective line-graphs and partition colorings ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ An improved hybrid ant-local search algorithm for the partition graph coloring problem ⋮ On column generation formulations for the RWA problem ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
Uses Software
Cites Work
- Unnamed Item
- Probability distribution of solution time in GRASP: an experimental investigation
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Randomized heuristics for the Max-Cut problem
- A GRASP with path-relinking for private virtual circuit routing
- The complexity of path coloring and call scheduling
