Publication:4229633
From MaRDI portal
zbMath0919.90097MaRDI QIDQ4229633
Martine Labbé, Ana Isabel Barros
Publication date: 22 February 1999
branch-and-bound; submodularity; subgradient optimization; greedy heuristic; discrete location theory; Lagrangian relaxations; locating pairs of facilities
Related Items
The multi-level uncapacitated facility location problem is not submodular, The multi-level uncapacitated facility location problem is not submodular, The vendor location problem, Lower bounds for the two-stage uncapacitated facility location problem, A review of hierarchical facility location models, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, A multiperiod two-echelon multicommodity capacitated plant location problem, A continuous model for production-distribution system design, Approximating the two-level facility location problem via a quasi-greedy approach, Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning, New facets for the two-stage uncapacitated facility location polytope
