Journal article · 2023 · Open access

Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection

Enhao Liu, Tengmu Hu, Theodore T. Allen, Christoph Hermes

Computers & Operations Research, 166, 106629 · Published 1 January 2023 · DOI 10.1016/j.cor.2024.106629

Open PDFView at the publisherCite this paper

In brief

“Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection” is a 2023 journal article by Enhao Liu and 3 co-authors, published in Computers & Operations Research. OpenAlex counts 16 citations as of 21 November 2026. It is open access: the full text is free to read at Computers & Operations Research.

Citations
16
Most cited in
2026 (10)
Field-weighted impact
2.15
References
35
Authors
4

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Liu, E., Hu, T., Allen, T. T., & Hermes, C. (2023). Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection. Computers & Operations Research, 166, 106629. https://doi.org/10.1016/j.cor.2024.106629

MLA 9

Liu, Enhao, et al. “Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection.” Computers & Operations Research, vol. 166, 2023, p. 106629. https://doi.org/10.1016/j.cor.2024.106629.

Chicago

Liu, Enhao, Tengmu Hu, Theodore T. Allen, and Christoph Hermes. 2023. “Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection.” Computers & Operations Research 166: 106629. https://doi.org/10.1016/j.cor.2024.106629.

Harvard

Liu, E. et al. (2023) ‘Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection’, Computers & Operations Research, 166, p. 106629. doi:10.1016/j.cor.2024.106629.

IEEE

E. Liu, T. Hu, T. T. Allen, and C. Hermes, “Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection,” Computers & Operations Research, vol. 166, p. 106629, 2023, doi: 10.1016/j.cor.2024.106629.

BibTeX

@article{liu2023optimal,
  title     = {{Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection}},
  author    = {Liu, Enhao and Hu, Tengmu and Allen, Theodore T. and Hermes, Christoph},
  journal   = {Computers \& Operations Research},
  year      = {2023},
  volume    = {166},
  pages     = {106629},
  doi       = {10.1016/j.cor.2024.106629},
  url       = {https://doi.org/10.1016/j.cor.2024.106629}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202411
202555
20261010

Its field-weighted citation impact is 2.15: it has been cited 2.15 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications

  • pipeline inspection
  • overfitting
  • branch-and-cut
  • integer programming formulation
  • oil spills

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Liu, E., Hu, T., Allen, T. T., & Hermes, C. (2023). Optimal Classification Trees with Leaf-Branch and Binary Constraints Applied to Pipeline Inspection. Computers & Operations Research, 166, 106629. https://doi.org/10.1016/j.cor.2024.106629

How many times has this paper been cited?

16 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Computers & Operations Research: sign in and open the PDF from this page.

Who wrote this paper?

Enhao Liu, Tengmu Hu, Theodore T. Allen, Christoph Hermes.

What is the DOI of this paper?

10.1016/j.cor.2024.106629, permanently at https://doi.org/10.1016/j.cor.2024.106629. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.