Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20437
@@ Property / full work available at URL: https://doi.org/10.1002/net.20437 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2100641445
@@ Property / OpenAlex ID: W2100641445 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of path coloring and call scheduling
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On column generation formulations for the RWA problem
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Routing and wavelength assignment by partition colouring
+Normal rank