On an instance of the inverse shortest paths problem

Didier Burton, Philippe Toint

Research output: Contribution to journalArticlepeer-review

149 Downloads (Pure)


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 Goldfarb-Idnani method for convex quadratic programming is then proposed and analyzed for one of the instances of the problem. Preliminary numerical results are reported.
Original languageEnglish
Pages (from-to)45-61
Number of pages17
JournalMathematical Programming
Issue number1-3
Publication statusPublished - 1 Jan 1992


Dive into the research topics of 'On an instance of the inverse shortest paths problem'. Together they form a unique fingerprint.

Cite this