Pages that link to "Item:Q819072"

The following pages link to Routing and wavelength assignment by partition colouring (Q819072):

Displaying 29 items.

• On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
• An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
• A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
• Routing and wavelength assignment in optical networks using bin packing based algorithms (Q856305) (← links)
• On column generation formulations for the RWA problem (Q1025995) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
• Perfectness of clustered graphs (Q1799385) (← links)
• Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands (Q2255944) (← links)
• A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
• A note on selective line-graphs and partition colorings (Q2294381) (← links)
• On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths (Q2628203) (← links)
• On some applications of the selective graph coloring problem (Q2629634) (← links)
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159) (← links)
• A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
• Stochastic RWA and Lightpath Rerouting in WDM Networks (Q5058011) (← links)
• On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
• Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)