Revisiting Lagrangian relaxation for network design (Q2414466): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2018.07.003
@@ Property / DOI: 10.1016/j.dam.2018.07.003 / 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.dam.2018.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2887687022
@@ Property / OpenAlex ID: W2887687022 / rank @@
+Normal rank
@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+Q3351135
@@ Property / cites work: Q3351135 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of heuristics and relaxations for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for the single source capacitated location problem.
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+Benders decomposition without separability: a computational study for capacitated facility location problems
+Normal rank
@@ Property / cites work @@
+-1 reformulations of the multicommodity capacitated network design problem
+Normal rank
@@ Property / cites work @@
+A stabilized structured Dantzig-Wolfe decomposition method
+Normal rank
@@ Property / cites work @@
+Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient solution of large scale, single-source, capacitated plant location problems
+Normal rank
@@ Property / cites work @@
+Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+An improved Lagrangian relaxation and dual ascent approach to facility location problems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+The simple plant location problem: Survey and synthesis
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+An exact cooperative method for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Q4411416
@@ Property / cites work: Q4411416 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian heuristic for the capacitated plant location problem with single source constraints
+Normal rank
@@ Property / cites work @@
+Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
+Normal rank
@@ Property / Wikidata QID @@
+Q129440055
@@ Property / Wikidata QID: Q129440055 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2018.07.003
@@ Property / DOI: 10.1016/J.DAM.2018.07.003 / rank @@
+Normal rank