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

Universite de Namur

Résultats de recherche: Contribution à un journal/une revue › Article › Revue par des pairs

160 Téléchargements (Pure)

Résumé

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.

langue originale	Anglais
Pages (de - à)	45-61
Nombre de pages	17
journal	Mathematical Programming
Volume	53
Numéro de publication	1-3
Les DOIs	https://doi.org/10.1007/BF01585693
Etat de la publication	Publié - 1 janv. 1992

Accès au document

10.1007/BF01585693

Technical Reportmanuscrit soumis, 177 KB

Autres fichiers et liens

Link to publication in Scopus

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
Sartenaer, A. & Toint, P.
1/01/87 → …
Projet: Axe de recherche

Inverse shortest paths problems
Auteur: Burton, D., 1993
Superviseur: Toint, P. (Promoteur) & Minoux, M. (Personne externe) (Jury)
Student thesis: Doc types › Docteur en Sciences

Contient cette citation

@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

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Projets

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire

Thèses de l'étudiant

Inverse shortest paths problems

Contient cette citation