On universal shortest paths

DOI10.1007/978-3-642-20009-0_50MaRDI QIDQ5232834zbMATH OpenOpenAlexFDO

Authors Lara Turner, Horst W. Hamacher

Publication date 13 September 2019

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2230

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Variants of shortest path problems
• scientific article; zbMATH DE number 1558116
• Complexity analysis and optimization of the shortest path tour problem
• The quadratic shortest path problem: complexity, approximability, and solution methods
• scientific article; zbMATH DE number 4073013

Cites work

• Linear and combinatorial optimization in ordered algebraic structures
• Location theory. A unified approach
• Minimizing the sum of the \(k\) largest functions in linear time.
• On discrete optimization with ordering
• On generalized balanced optimization problems
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• The \(k\)-centrum shortest path problem

Cited in

(4)

• Variants of shortest path problems
• On the generality of the greedy algorithm for solving matroid base problems
• On universal and multiobjective model extensions for combinatorial optimization problems
• Finite paths are universal

This page was built for publication: On universal shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232834)