The \(k\)-centrum shortest path problem

DOI10.1007/BF02837564zbMath1278.90062MaRDI QIDQ997931

Timothy J. Lowe, Robert Garfinkel, Elena Fernández

Publication date: 8 August 2007

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

shortest path\(k\)-centrum

Mathematics Subject Classification ID

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

Related Items (8)

On discrete optimization with ordering ⋮ Revisiting \(k\)-sum optimization ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ A comparison of formulations and solution methods for the minimum-envy location problem ⋮ On Universal Shortest Paths ⋮ Shortest paths with ordinal weights ⋮ Shortest path with acceleration constraints: complexity and approximation algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A parametric approach to solving bicriterion shortest path problems
• Shortest path problems with time windows on nodes and arcs
• An improved FPTAS for Restricted Shortest Path.
• Maximal Flow Through a Network
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• Properties of thek-centra in a tree network
• Centers to centroids in graphs
• Bottleneck extrema
• The \(k\)-centrum multi-facility location problem

This page was built for publication: The \(k\)-centrum shortest path problem