Successive computation of some efficient locations of the Weber problem with barriers
From MaRDI portal
Publication:2511354
DOI10.1007/s12190-012-0637-xzbMath1305.90260OpenAlexW2071935600MaRDI QIDQ2511354
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-012-0637-x
Uses Software
Cites Work
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The multi-facility location-allocation problem with polyhedral barriers
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Location problems with costs being sums of powers of Euclidean distances
- 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
- Algebraic properties of location problems with one circular barrier.
- A cellular heuristic for the multisource Weber problem.
- Planar Weber location problems with barriers and block norms
- Planar weber location problems with line barriers
- Efficiency in multiple objective optimization problems
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Successive computation of some efficient locations of the Weber problem with barriers