"k-Tree: Crossing sharp boundaries in regression trees to find neighbors."

Xuecheng Tian et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2025.02.031

access: closed

type: Journal Article

metadata version: 2025-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/TianWZS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/TianWZS25
Xuecheng Tian, Shuaian Wang, Lu Zhen, Zuo-Jun Max Shen:
k-Tree: Crossing sharp boundaries in regression trees to find neighbors. Eur. J. Oper. Res. 324(2): 567-579 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.