Routing and wavelength assignment by partition colouring
From MaRDI portal
Publication:819072
DOI10.1016/J.EJOR.2004.09.007zbMATH Open1116.90073OpenAlexW1984237147MaRDI QIDQ819072FDOQ819072
Authors: Thiago F. Noronha, Celso C. 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- The complexity of path coloring and call scheduling
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Probability distribution of solution time in GRASP: an experimental investigation
- Randomized heuristics for the Max-Cut problem
- A GRASP with path-relinking for private virtual circuit routing
Cited In (33)
- Extending time‐to‐target plots to multiple instances
- On the minimum and maximum selective graph coloring problems in some graph classes
- Biased random-key genetic algorithms with applications in telecommunications
- Dual-neighborhood iterated local search for routing and wavelength assignment
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
- Perfectness of clustered graphs
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- On column generation formulations for the RWA problem
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- An exact algorithm for the partition coloring problem
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- A branch-and-price approach for the partition coloring problem
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Title not available (Why is that?)
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- On the complexity of the selective graph coloring problem in some special classes of graphs
- On some applications of the selective graph coloring problem
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Solving the Static Design Routing and Wavelength Assignment Problem
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- A branch-and-cut algorithm for partition coloring
- Title not available (Why is that?)
- A note on selective line-graphs and partition colorings
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- Stochastic RWA and Lightpath Rerouting in WDM Networks
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
- Title not available (Why is that?)
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
Uses Software
This page was built for publication: Routing and wavelength assignment by partition colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819072)
