A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
From MaRDI portal
Publication:458952
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
Cites work
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 51877 (Why is no real title available?)
- A unified model for Weber problems with continuous and network distances
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Convex Location Problems on Tree Networks
- DC programming: overview.
- GBSSS: The generalized big square small square method for planar single- facility location
- Maximizing trip coverage in the location of a single rapid transit alignment
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
- Optimal location of transportation devices
- THE HEAVY LUGGAGE METRIC
- The Minisum and Minimax Location Problems Revisited
- The big cube small cube solution method for multidimensional facility location problems
- The gradual covering decay location problem on a network.
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Voronoi diagram for services neighboring a highway
- Weber problems with alternative transportation systems
- Weber problems with high-speed lines
Cited in
(6)- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- Covering part of a planar network
- Minisum multipurpose trip location problem on trees
- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
- The weighted set relation: characterizations in the convex case
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)
