A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
DOI10.1007/S11750-012-0251-YzbMATH Open1299.90225OpenAlexW1983197119MaRDI QIDQ458952FDOQ458952
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
Recommendations
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- Covering part of a planar network
- scientific article; zbMATH DE number 961964
- The \(p\) maximal cover -- \(p\) partial center problem on networks
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Continuous location (90B85)
Cites Work
- DC programming: overview.
- Voronoi diagram for services neighboring a highway
- Title not available (Why is that?)
- Title not available (Why is that?)
- The gradual covering decay location problem on a network.
- The Minisum and Minimax Location Problems Revisited
- GBSSS: The generalized big square small square method for planar single- facility location
- The big cube small cube solution method for multidimensional facility location problems
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
- Optimal location of transportation devices
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Convex Location Problems on Tree Networks
- Maximizing trip coverage in the location of a single rapid transit alignment
- Weber problems with alternative transportation systems
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- A unified model for Weber problems with continuous and network distances
- THE HEAVY LUGGAGE METRIC
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
- Title not available (Why is that?)
- Weber problems with high-speed lines
Cited In (5)
- Title not available (Why is that?)
- 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
- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- Minisum multipurpose trip location problem on trees
This page was built for publication: A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458952)
