Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295): 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.2004.04.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2026135007
@@ Property / OpenAlex ID: W2026135007 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming formulations of discrete hub location problems
+Normal rank
@@ Property / cites work @@
+A quadratic integer program for the location of interacting hub facilities
+Normal rank
@@ Property / cites work @@
+Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
+Normal rank
@@ Property / cites work @@
+Q3147668
@@ Property / cites work: Q3147668 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution algorithms for the capacitated single allocation hub location problem
+Normal rank
@@ Property / cites work @@
+Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
+Normal rank
@@ Property / cites work @@
+The capacitated multiple allocation hub location problem: Formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Preprocessing and cutting for multiple allocation hub location problems.
+Normal rank
@@ Property / cites work @@
+Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
+Normal rank