On an instance of the inverse shortest paths problem
From MaRDI portal
Publication:1184336
DOI10.1007/BF01585693zbMath0756.90089MaRDI QIDQ1184336
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C20: Quadratic programming
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Uses Software
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- A note on two problems in connexion with graphs
- On the quadratic programming algorithm of Goldfarb and Idnani
- A projected newton method forl p norm location problems
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item