BibTeX records: Nicholas A. Pearson

• > Home > Persons > Nicholas A. Pearson

@article{DBLP:journals/cor/LetchfordP08,
  author       = {Adam N. Letchford and
                  Nicholas A. Pearson},
  title        = {Good triangulations yield good tours},
  journal      = {Comput. Oper. Res.},
  volume       = {35},
  number       = {2},
  pages        = {638--647},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.cor.2006.03.025},
  doi          = {10.1016/J.COR.2006.03.025},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cor/LetchfordP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/LetchfordP08,
  author       = {Adam N. Letchford and
                  Nicholas A. Pearson},
  title        = {Exploiting planarity in separation routines for the symmetric traveling
                  salesman problem},
  journal      = {Discret. Optim.},
  volume       = {5},
  number       = {2},
  pages        = {220--230},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.disopt.2007.05.002},
  doi          = {10.1016/J.DISOPT.2007.05.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/LetchfordP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/LetchfordP05,
  author       = {Adam N. Letchford and
                  Nicholas A. Pearson},
  title        = {A fast algorithm for minimum weight odd circuits and cuts in planar
                  graphs},
  journal      = {Oper. Res. Lett.},
  volume       = {33},
  number       = {6},
  pages        = {625--628},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.orl.2004.12.001},
  doi          = {10.1016/J.ORL.2004.12.001},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/orl/LetchfordP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}