Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
From MaRDI portal
Publication:5131704
DOI10.1287/ijoc.2017.0757zbMath1446.90105OpenAlexW2756812726MaRDI QIDQ5131704
Camilo Ortiz-Astorquiza, Gilbert Laporte, Iván A. Contreras
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/13e1828519e033285effba0a654e2e214347844c
Mixed integer programming (90C11) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Fractional 0-1 programming and submodularity, Integrating supplier selection decisions into an inventory location problem for designing the supply chain network, Multi-level facility location problems, Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-level facility location as the maximization of a submodular set function
- Hierarchical facility network planning model for global logistics network configurations
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A review of hierarchical facility location models
- A new approximation algorithm for the multilevel facility location problem
- Facility location and supply chain management. A review
- Maximization of submodular functions: theory and enumeration algorithms
- Upper and lower bounds for the two-level simple plant location problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Use of location-allocation models in health service development planning in developing nations
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A new mixed integer linear programming model for the multi level uncapacitated facility location problem
- A note on the maximization version of the multi-level facility location problem
- A hierarchical location model for public facility planning
- Approximating the two-level facility location problem via a quasi-greedy approach
- Hub Location as the Minimization of a Supermodular Set Function
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- The Nested Hierarchical Median Facility Location Model
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Heuristics for the fixed cost median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- A Plant and Warehouse Location Problem
- An Analysis of the Greedy Heuristic for Independence Systems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- On the Two-Level Uncapacitated Facility Location Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- The multi-level uncapacitated facility location problem is not submodular
