A polynomial-time algorithm to find shortest paths with recourse - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

J. Scott Provan. A polynomial-time algorithm to find shortest paths with recourse. Networks, 41(2):115-125, 2003. [doi]

@article{Provan03,
  title = {A polynomial-time algorithm to find shortest paths with recourse},
  author = {J. Scott Provan},
  year = {2003},
  doi = {10.1002/net.10063},
  url = {http://dx.doi.org/10.1002/net.10063},
  researchr = {https://researchr.org/publication/Provan03},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {41},
  number = {2},
  pages = {115-125},
}

runs on WebDSL