A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances

DOI10.1016/j.ejor.2016.12.025zbMath1402.90076OpenAlexW2565001840MaRDI QIDQ1753405

Anita Schöbel, M. C. López-de-los-Mozos, Juan A. Mesa

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/89926

zbMATH Keywords

networkslocationcovering problemsmixed distances

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

To stop or not to stop: a time-constrained trip covering location problem on a tree network ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line

Cites Work

• Unnamed Item
• Unnamed Item
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
• The big cube small cube solution method for multidimensional facility location problems
• Maximizing trip coverage in the location of a single rapid transit alignment
• Locating stops along bus or railway lines -- a bicriteria problem
• General network design: a unified view of combined location and network design problems
• Optimization methods for the planning of rapid transit systems
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• Finite Dominating Sets for Network Location Problems
• Convex Analysis
• Locating stations on rapid transit lines

This page was built for publication: A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances