An Efficient Algorithm for Determining the Length of the Longest Dead Path in a LIFO Branch-and-Bound Exploration Schema

Stefano Pallottino, Tommaso Toffoli. An Efficient Algorithm for Determining the Length of the Longest Dead Path in a LIFO Branch-and-Bound Exploration Schema. ACM Transactions on Mathematical Software, 7(4):498-504, 1981. [doi]

@article{PallottinoT81,
  title = {An Efficient Algorithm for Determining the Length of the Longest Dead Path in a   LIFO   Branch-and-Bound Exploration Schema},
  author = {Stefano Pallottino and Tommaso Toffoli},
  year = {1981},
  doi = {10.1145/355972.355977},
  url = {http://doi.acm.org/10.1145/355972.355977},
  tags = {XML, XML Schema},
  researchr = {https://researchr.org/publication/PallottinoT81},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Mathematical Software},
  volume = {7},
  number = {4},
  pages = {498-504},
}