Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168): Difference between revisions

@@ Property / DOI @@
-.1007/s10589-016-9836-y
@@ Property / DOI: 10.1007/s10589-016-9836-y / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-016-9836-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2296210203
@@ Property / OpenAlex ID: W2296210203 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q42405487
@@ Property / Wikidata QID: Q42405487 / rank @@
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
+Normal rank
@@ Property / cites work @@
+On generalized minimum spanning trees
@@ Property / cites work: On generalized minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized network design problems.
@@ Property / cites work: Generalized network design problems. / rank @@
+Normal rank
@@ Property / cites work @@
+The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+Point Measurements for a Neumann-to-Dirichlet Map and the Calderón Problem in the Plane
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Search for the Generalized Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search
+Normal rank
@@ Property / cites work @@
+Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+On the generalized minimum spanning tree problem
@@ Property / cites work: On the generalized minimum spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search heuristic for the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4448919
@@ Property / cites work: Q4448919 / rank @@
+Normal rank
@@ Property / cites work @@
+New models of the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A new relaxation method for the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A directed cycle-based column-and-cut generation method for capacitated survivable network design
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
+Normal rank
@@ Property / DOI @@
+.1007/S10589-016-9836-Y
@@ Property / DOI: 10.1007/S10589-016-9836-Y / rank @@
+Normal rank