A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201): Difference between revisions

@@ 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.1016/j.cor.2010.07.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2134567220
@@ Property / OpenAlex ID: W2134567220 / rank @@
+Normal rank
@@ Property / cites work @@
+Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
+Normal rank
@@ Property / cites work @@
+Network hub location problems: The state of the art
+Normal rank
@@ Property / cites work @@
+Facets of the clique partitioning polytope
@@ Property / cites work: Facets of the clique partitioning polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+The equipartition polytope. II: Valid inequalities and facets
+Normal rank
@@ Property / cites work @@
+Location-area partition in a cellular radio network
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:709201