A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
From MaRDI portal
Publication:458952
DOI10.1007/s11750-012-0251-yzbMath1299.90225OpenAlexW1983197119MaRDI QIDQ458952
Daniel Scholz, Federico Perea, Juan A. Mesa, Mark-Christoph Körner, Anita Schöbel
Publication date: 8 October 2014
Published in: Top (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/62769
Continuous location (90B85) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (4)
To stop or not to stop: a time-constrained trip covering location problem on a tree network ⋮ Unnamed Item ⋮ A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances ⋮ Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Weber problems with high-speed lines
- The big cube small cube solution method for multidimensional facility location problems
- Maximizing trip coverage in the location of a single rapid transit alignment
- Optimal location of transportation devices
- Voronoi diagram for services neighboring a highway
- Continuous location problems and big triangle small triangle: Constructing better bounds
- GBSSS: The generalized big square small square method for planar single- facility location
- Weber problems with alternative transportation systems
- The gradual covering decay location problem on a network.
- DC programming: overview.
- A unified model for Weber problems with continuous and network distances
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
- THE HEAVY LUGGAGE METRIC
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
- The Minisum and Minimax Location Problems Revisited
- Convex Location Problems on Tree Networks
This page was built for publication: A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
