Solving a capacitated hub location problem (Q2384615): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2006.11.026
@@ Property / DOI: 10.1016/j.ejor.2006.11.026 / rank @@
-Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Designing cost-effective content distribution networks
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors
+Normal rank
@@ Property / cites work @@
+Integer programming formulations of discrete hub location problems
+Normal rank
@@ Property / cites work @@
+A survey on Benders decomposition applied to fixed-charge network design problems
+Normal rank
@@ Property / cites work @@
+The capacitated multiple allocation hub location problem: Formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
+Normal rank
@@ Property / cites work @@
+Exact solution of multicommodity network optimization problems with general step cost functions
+Normal rank
@@ Property / cites work @@
+Dioïds and semirings: Links to fuzzy sets and other applications
+Normal rank
@@ Property / cites work @@
+Adapting polyhedral properties from facility to hub location problems
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+A generalization of max flow—min cut
@@ Property / cites work: A generalization of max flow—min cut / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution methods for uncapacitated location problems with convex transportation costs
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Tailoring Benders decomposition for uncapacitated network design
+Normal rank
@@ Property / cites work @@
+Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
+Normal rank
@@ Property / cites work @@
+HubLocator: An exact solution method for the multiple allocation hub location problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Hub network design with single and multiple allocation: A computational study
+Normal rank
@@ Property / cites work @@
+Benders-and-cut algorithm for fixed-charge capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
+Normal rank
@@ Property / cites work @@
+A demand-shifting feasibility algorithm for Benders decomposition.
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2006.11.026
@@ Property / DOI: 10.1016/J.EJOR.2006.11.026 / rank @@
+Normal rank