liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Inverse Shortest Path Models Based on Fundamental Cycle Bases
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
2012 (English)In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland / [ed] Diethard Klatte, Hans-Jakob Lüthi, Karl Schmedders, Springer Berlin/Heidelberg, 2012, 77-82 p.Chapter in book (Refereed)
Abstract [en]

The inverse shortest path problem has received considerable attention in the literature since the seminal paper by Burton and Toint from 1992. Given a graph and a set of paths the problem is to find arc costs such that all specified paths are shortest paths. The quality of the arc costs is measured by the deviation from some ideal arc costs. Our contribution is a novel modeling technique for this problem based on fundamental cycle bases. For LP compatible norms we present a cycle basis model equivalent to the LP dual. The LP dual of our cycle basis model is a path based model that only requires a polynomial number of path constraints. This model is valid also for LP incompatible norms. This yields the first polynomial sized path formulation of the original problem.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2012. 77-82 p.
Series
Operations Research Proceedings, ISSN 0721-5924
National Category
Natural Sciences
Identifiers
URN: urn:nbn:se:liu:diva-87558DOI: 10.1007/978-3-642-29210-1_13ISI: 000311229100013Local ID: e-8-3-642-29210-1ISBN: 978-3-642-29209-5 (print)OAI: oai:DiVA.org:liu-87558DiVA: diva2:589583
Available from: 2013-01-18 Created: 2013-01-18 Last updated: 2013-08-29

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Call, MikaelHolmberg, Kaj

Search in DiVA

By author/editor
Call, MikaelHolmberg, Kaj
By organisation
Optimization The Institute of Technology
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf