The multi-facility location-allocation problem with polyhedral barriers
From MaRDI portal
Publication:960384
DOI10.1016/J.COR.2008.02.014zbMATH Open1177.90322OpenAlexW2057821909MaRDI QIDQ960384FDOQ960384
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
Recommendations
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal method for solving the (generalized) multi-Weber problem
- An efficient tabu search procedure for the \(p\)-median problem
- Location-Allocation Problems
- Title not available (Why is that?)
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- A continuous location-allocation problem with zone-dependent fixed cost
- Title not available (Why is that?)
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- On the Complexity of Some Common Geometric Location Problems
- On the Set of Optimal Points to the Weber Problem: Further Results
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- A reduction result for location problems with polyhedral barriers
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Two algorithms for the multi-Weber problem
Cited In (20)
- Location of connection facilities.
- LOCATION-ALLOCATION PROBLEM OF MULTI-PERSON FACILITY
- Supply facility and input/output point locations in the presence of barriers
- An algorithmic framework for solving geometric covering problems -- with applications
- Title not available (Why is that?)
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- Rectilinear distance to a facility in the presence of a square barrier
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Successive computation of some efficient locations of the Weber problem with barriers
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- A reduction result for location problems with polyhedral barriers
- A wavefront approach to center location problems with barriers
- Planar location problems with block distance and barriers
- Continuous location model of a rectangular barrier facility
- Dominating sets for rectilinear center location problems with polyhedral barriers
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
- Algebraic properties of location problems with one circular barrier.
This page was built for publication: The multi-facility location-allocation problem with polyhedral barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960384)
