On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

D. Burton, Ph.L. Toint

Research output: Contribution to journalArticlepeer-review

33 Downloads (Pure)

Abstract

This paper considers the inverse shortest paths problem where arc costs are subject to correlation constraints. The motivation for this research arises from applications in traffic modelling and seismic tomography. A new method is proposed for solving this class of problems. It is constructed as a generalization of the algorithm presented in Burton and Toint (Mathematical Programming 53, 1992) for uncorrelated inverse shortest paths. Preliminary numerical experience with the new method is presented and discussed. © 1994 The Mathematical Programming Society, Inc.
Original languageEnglish
Pages (from-to)1-22
Number of pages22
JournalMathematical Programming
Volume63
Issue number1-3
DOIs
Publication statusPublished - 1 Jan 1994

Fingerprint

Dive into the research topics of 'On the use of an inverse shortest paths algorithm for recovering linearly correlated costs'. Together they form a unique fingerprint.

Cite this