A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
type: Item
instance of: scholarly article
title: A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
zbMATH Open document ID: 1299.90225
author: Mark-Christoph Körner
author: Juan A. Mesa
author: Federico Perea
author: Anita Schöbel
author: Daniel Scholz
published in: Top
publication date: 2014-10-08T00:00:00Z
full work available at URL: http://hdl.handle.net/10251/62769
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6352461
zbMATH Keywords: location
zbMATH Keywords: covering problem
zbMATH Keywords: transportation
MaRDI profile type: Publication
OpenAlex ID: W1983197119
cites work: Voronoi diagram for services neighboring a highway
cites work: THE HEAVY LUGGAGE METRIC
cites work: OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
cites work: The gradual covering decay location problem on a network.
cites work: Continuous location problems and big triangle small triangle: Constructing better bounds
cites work: Optimal location of transportation devices
cites work: Weber problems with alternative transportation systems
cites work: Convex Location Problems on Tree Networks
cites work: CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
cites work: The Minisum and Minimax Location Problems Revisited
cites work: DC programming: overview.
cites work: Q4002254
cites work: Weber problems with high-speed lines
cites work: Maximizing trip coverage in the location of a single rapid transit alignment
cites work: A unified model for Weber problems with continuous and network distances
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: Q3147657
cites work: Q3694703
cites work: The big cube small cube solution method for multidimensional facility location problems
cites work: The theoretical and empirical rate of convergence for geometric branch-and-bound methods
DOI: 10.1007/S11750-012-0251-Y
description: scientific article; zbMATH DE number 6352461