A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
From MaRDI portal
Publication:761340
DOI10.1016/0377-2217(84)90156-5zbMath0555.90036OpenAlexW2087955655MaRDI QIDQ761340
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90156-5
Related Items
A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs ⋮ Production/distribution system design with inventory considerations ⋮ 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 ⋮ Multi-level facility location as the maximization of a submodular set function ⋮ 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 ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A review of hierarchical facility location models ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking ⋮ 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 ⋮ The capacitated distribution and waste disposal problem ⋮ The multi-level uncapacitated facility location problem is not submodular ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem ⋮ Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem ⋮ A two-level network for recycling sand: A case study
Cites Work
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A cost operator approach to multistage location-allocation
- A Dual-Based Procedure for Dynamic Facility Location
- A cost function property for plant location problems
- Comments on the note of Frieze
- Multicommodity Distribution System Design by Benders Decomposition
- An analysis of approximations for maximizing submodular set functions—I
- A Plant and Warehouse Location Problem
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
