Location of speed-up subnetworks

DOI10.1007/s10479-014-1628-0zbMath1306.90023OpenAlexW2094476727MaRDI QIDQ2259045

Anita Schöbel, Marie E. Schmidt

Publication date: 27 February 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1628-0

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Comments on: ``Extensive facility location problems on networks: an updated review ⋮ Benders decomposition for network design covering problems ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ Line planning with user-optimal route choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Line planning in public transportation: models and methods
• Range minimization problems in path-facility location on trees
• Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks
• A review of extensive facility location in networks
• Locating tree-shaped facilities using the ordered median objective
• On subtrees of trees
• Locating median cycles in networks
• General network design: a unified view of combined location and network design problems
• Variable neighbourhood structures for cycle location problems
• Minimizing the Oriented Diameter of a Planar Graph
• Insertion heuristics for central cycle problems
• Reliable and Restricted Quickest Path Problems
• On locating path- or tree-shaped facilities on networks
• Minimizing the Diameter of a Network Using Shortcut Edges
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• A Heuristic Procedure For Path Location With Multisource Demand

This page was built for publication: Location of speed-up subnetworks