On an instance of the inverse shortest paths problem

Didier Burton; Philippe Toint

doi:10.1007/BF01585693

On an instance of the inverse shortest paths problem

Didier Burton, Philippe Toint

University of Namur

Research output: Contribution to journal › Article › peer-review

160 Downloads (Pure)

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 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 language	English
Pages (from-to)	45-61
Number of pages	17
Journal	Mathematical Programming
Volume	53
Issue number	1-3
DOIs	https://doi.org/10.1007/BF01585693
Publication status	Published - 1 Jan 1992

Access to Document

10.1007/BF01585693

Technical ReportSubmitted manuscript, 177 KB

Cite this

@article{562c0e12abde4de587a34489b06ce759,

title = "On an instance of the inverse shortest paths problem",

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 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.",

author = "Didier Burton and Philippe Toint",

year = "1992",

month = jan,

day = "1",

doi = "10.1007/BF01585693",

language = "English",

volume = "53",

pages = "45--61",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1-3",

}

TY - JOUR

T1 - On an instance of the inverse shortest paths problem

AU - Burton, Didier

AU - Toint, Philippe

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026742679&partnerID=8YFLogxK

U2 - 10.1007/BF01585693

DO - 10.1007/BF01585693

M3 - Article

AN - SCOPUS:0026742679

SN - 0025-5610

VL - 53

SP - 45

EP - 61

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1-3

ER -

On an instance of the inverse shortest paths problem

Abstract

Access to Document

Other files and links

Fingerprint

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Inverse shortest paths problems

Cite this

On an instance of the inverse shortest paths problem

Abstract

Access to Document

Other files and links

Fingerprint

Projects

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Student theses

Inverse shortest paths problems

Cite this