Projects per year
Abstract
The inverse shortest paths problem in a graph is considered, that is, the problem of recovering the arc costs given some information about the shortest paths in the graph. The problem is first motivated by some practical examples arising from applications. An algorithm based on the GoldfarbIdnani method for convex quadratic programming is then proposed and analyzed for one of the instances of the problem. Preliminary numerical results are reported.
Original language  English 

Pages (fromto)  4561 
Number of pages  17 
Journal  Mathematical Programming 
Volume  53 
Issue number  13 
DOIs  
Publication status  Published  1 Jan 1992 
Fingerprint Dive into the research topics of 'On an instance of the inverse shortest paths problem'. Together they form a unique fingerprint.
Projects
 1 Active
Student Theses

Inverse shortest paths problems
Author: Burton, D., 1993Supervisor: Toint, P. (Supervisor) & Minoux, M. (External person) (Jury)
Student thesis: Doc types › Doctor of Sciences