A Bi-Objective Median Location Problem With a Line Barrier
From MaRDI portal
Publication:3635129
Recommendations
- Planar weber location problems with line barriers
- scientific article; zbMATH DE number 1855792
- Algebraic properties of location problems with one circular barrier.
- A reduction result for location problems with polyhedral barriers
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
Cited in
(15)- The multi-facility location-allocation problem with polyhedral barriers
- 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
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Algebraic properties of location problems with one circular barrier.
- A global optimization procedure for the location of a median line in the three-dimensional space
- Multiple criteria facility location problems: a survey
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- A planar single facility location and border crossing problem
- Planar weber location problems with line barriers
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- Bi-objective location model of two rectangular facilities
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
This page was built for publication: A Bi-Objective Median Location Problem With a Line Barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635129)
