scientific article; zbMATH DE number 1253065
From MaRDI portal
Publication:4229633
zbMath0919.90097MaRDI QIDQ4229633
Ana Isabel Barros, Martine Labbé
Publication date: 22 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundsubmodularitysubgradient optimizationgreedy heuristicdiscrete location theoryLagrangian relaxationslocating pairs of facilities
Related Items
A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures ⋮ Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints ⋮ A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points ⋮ Calculating the best dual bound for problems with multiple Lagrangian relaxations ⋮ Lower bounds for the two-stage uncapacitated facility location problem ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A review of hierarchical facility location models ⋮ Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location ⋮ Multi-level facility location problems ⋮ Formulations and relaxations for a multi-echelon capacitated location-distribution problem ⋮ The vendor location problem ⋮ The multi-level uncapacitated facility location problem is not submodular ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ A multiperiod two-echelon multicommodity capacitated plant location problem ⋮ The multi-level uncapacitated facility location problem is not submodular ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ A continuous model for production-distribution system design
