The multi-facility location-allocation problem with polyhedral barriers
From MaRDI portal
Publication:960384
DOI10.1016/j.cor.2008.02.014zbMath1177.90322OpenAlexW2057821909MaRDI QIDQ960384
Kathrin Klamroth, Martin Bischoff, Tina Fleischmann
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.02.014
Related Items (11)
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Continuous location model of a rectangular barrier facility ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ Successive computation of some efficient locations of the Weber problem with barriers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A continuous location-allocation problem with zone-dependent fixed cost
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An optimal method for solving the (generalized) multi-Weber problem
- An efficient algorithm for facility location in the presence of forbidden regions
- An efficient tabu search procedure for the \(p\)-median problem
- Two algorithms for the multi-Weber problem
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- On the Complexity of Some Common Geometric Location Problems
- Location-Allocation Problems
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- On the Set of Optimal Points to the Weber Problem: Further Results
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- A reduction result for location problems with polyhedral barriers
This page was built for publication: The multi-facility location-allocation problem with polyhedral barriers
