A unified model for Weber problems with continuous and network distances
From MaRDI portal
Publication:2384880
DOI10.1016/J.COR.2006.03.001zbMath1141.90024OpenAlexW1985658652MaRDI QIDQ2384880
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.001
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Related Items (7)
Weber problems with high-speed lines ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Algorithms for location problems based on angular distances ⋮ Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538] ⋮ Simultaneous location of a service facility and a rapid transit line ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ Local improvement in planar facility location using vehicle routing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Mixed planar/network facility location problems
- Hull properties in location problems
- GBSSS: The generalized big square small square method for planar single- facility location
- Weber problems with alternative transportation systems
- A linearization method for mixed 0--1 polynomial programs
- Routing and location on a network with hazardous threats
- Using Block Norms for Location Modeling
- Location Theory, Dominance, and Convexity
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
- A reduction result for location problems with polyhedral barriers
This page was built for publication: A unified model for Weber problems with continuous and network distances
