Routing and wavelength assignment by partition colouring
From MaRDI portal
Publication:819072
Recommendations
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A GRASP with path-relinking for private virtual circuit routing
- New methods to color the vertices of a graph
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Probability distribution of solution time in GRASP: an experimental investigation
- Randomized heuristics for the Max-Cut problem
- The complexity of path coloring and call scheduling
Cited in
(34)- scientific article; zbMATH DE number 5990404 (Why is no real title available?)
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
- Biased random-key genetic algorithms with applications in telecommunications
- Solving the Static Design Routing and Wavelength Assignment Problem
- scientific article; zbMATH DE number 6381717 (Why is no real title available?)
- A branch-and-cut algorithm for partition coloring
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Extending time-to-target plots to multiple instances
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- On column generation formulations for the RWA problem
- An exact algorithm for the partition coloring problem
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- On the complexity of the selective graph coloring problem in some special classes of graphs
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
- On some applications of the selective graph coloring problem
- 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
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
- Stochastic RWA and lightpath rerouting in WDM networks
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A note on selective line-graphs and partition colorings
- A branch-and-price approach for the partition coloring problem
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- scientific article; zbMATH DE number 2079419 (Why is no real title available?)
- On the minimum and maximum selective graph coloring problems in some graph classes
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
- Reinforcement learning based tabu search for the minimum load coloring problem
- Perfectness of clustered graphs
- Dual-neighborhood iterated local search for routing and wavelength assignment
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)
