The transit time constrained fixed charge multi-commodity network design problem (Q2669603): Difference between revisions

@@ Property / cites work @@
+Container shipping service selection and cargo routing with transshipment limits
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / 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 @@
+Dual-Optimal Inequalities for Stabilized Column Generation
+Normal rank
@@ Property / cites work @@
+The Continuous-Time Service Network Design Problem
+Normal rank
@@ Property / cites work @@
+Generalized dynamic programming for multicriteria optimization
+Normal rank
@@ Property / cites work @@
+The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+Liner shipping network design
@@ Property / cites work: Liner shipping network design / rank @@
+Normal rank
@@ Property / cites work @@
+An integrated model for logistics network design
@@ Property / cites work: An integrated model for logistics network design / rank @@
+Normal rank
@@ Property / cites work @@
+Benders, metric and cutset inequalities for multicommodity capacitated network design
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+Q3500141
@@ Property / cites work: Q3500141 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simplex-Based Tabu Search Method for Capacitated Network Design
+Normal rank
@@ Property / cites work @@
+Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
+Normal rank
@@ Property / cites work @@
+Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
+Normal rank
@@ Property / cites work @@
+Large-Scale, Less-than-Truckload Service Network Design
+Normal rank
@@ Property / cites work @@
+Competitive liner shipping network design
@@ Property / cites work: Competitive liner shipping network design / rank @@
+Normal rank
@@ Property / cites work @@
+A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
+Normal rank
@@ Property / cites work @@
+A capacity scaling heuristic for the multicommodity capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753949
@@ Property / cites work: Q2753949 / rank @@
+Normal rank
@@ Property / cites work @@
+A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the Bounded Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A survey of resource constrained shortest path problems: Exact solution approaches
+Normal rank
@@ Property / cites work @@
+Multi-objective and multi-constrained non-additive shortest path problems
+Normal rank
@@ Property / cites work @@
+A local branching heuristic for the capacitated fixed-charge network design problem
+Normal rank
@@ Property / cites work @@
+A branch-and-price approach to the feeder network design problem
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
+Normal rank