Tight bounds from a path based formulation for the tree of hub location problem (Q833527): Difference between revisions

@@ Property / author @@
+Iván A. Contreras
@@ Property / author: Iván A. Contreras / rank @@
+Normal rank
@@ Property / author @@
+Elena Fernández
@@ Property / author: Elena Fernández / 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.1016/j.cor.2008.12.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2076515248
@@ Property / OpenAlex ID: W2076515248 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2776481
@@ Property / cites work: Q2776481 / rank @@
+Normal rank
@@ Property / cites work @@
+A Benders Decomposition for Hub Location Problems Arising in Public Transport
+Normal rank
@@ Property / cites work @@
+Hub Arc Location Problems: Part I—Introduction and Results
+Normal rank
@@ Property / cites work @@
+Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Network design for time‐constrained delivery
@@ Property / cites work: Network design for time‐constrained delivery / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the optimal \(p\)-source communication spanning tree
+Normal rank
@@ Property / cites work @@
+On locating path- or tree-shaped facilities on networks
+Normal rank
@@ Property / cites work @@
+Q5689811
@@ Property / cites work: Q5689811 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating tree-shaped facilities using the ordered median objective
+Normal rank
@@ Property / cites work @@
+An extension to rapid transit network design problem
+Normal rank
@@ Property / cites work @@
+The Ring Star Problem: Polyhedral analysis and exact algorithm
+Normal rank
@@ Property / cites work @@
+Locating a cycle in a transportation or a telecommunications network
+Normal rank
@@ Property / cites work @@
+Integer programming formulations of discrete hub location problems
+Normal rank
@@ Property / cites work @@
+Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
+Normal rank
@@ Property / cites work @@
+Solution algorithms for the capacitated single allocation hub location problem
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Formulating and solving splittable capacitated multiple allocation hub location problems
+Normal rank