| A scalable MIP-based method for learning optimal multivariate decision trees H Zhu, P Murali, DT Phan, LM Nguyen, JR Kalagnanam Advances in Neural Information Processing Systems, 2020, 2020 | 43 | 2020 |
| Integer packing sets form a well-quasi-ordering A Del Pia, D Gijswijt, J Linderoth, H Zhu Operations Research Letters 49 (2), 226-230, 2021 | 8 | 2021 |
| Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation A Del Pia, J Linderoth, H Zhu Mathematical Programming, 1-29, 2022 | 7 | 2022 |
| On the complexity of separating cutting planes for the knapsack polytope A Del Pia, J Linderoth, H Zhu Mathematical Programming, 1-27, 2023 | 5 | 2023 |
| New Classes of Facets for Complementarity Knapsack Problems A Del Pia, J Linderoth, H Zhu arXiv preprint arXiv:2203.02873, 2022 | 4 | 2022 |
| Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation A Del Pia, J Linderoth, H Zhu arXiv preprint arXiv:2106.00301, 2021 | 2 | 2021 |
| Relaxations and cutting planes for linear programs with complementarity constraints A Del Pia, J Linderoth, H Zhu Journal of Global Optimization, 1-25, 2024 | 1 | 2024 |
| On the Polyhedrality of the Chvatal-Gomory Closure H Zhu arXiv preprint arXiv:2106.00295, 2021 | 1 | 2021 |
| The k-aggregation closure for covering sets H Zhu Discrete Optimization 50, 100805, 2023 | | 2023 |
| Optimal interpretable decision trees using integer linear programming techniques P Murali, H Zhu, DT Phan, L Nguyen US Patent 11,676,039, 2023 | | 2023 |
| The Complexity of Recognizing Facets for the Knapsack Polytope R Chen, H Zhu arXiv preprint arXiv:2211.03311, 2022 | | 2022 |
| Recognition of Facets for Knapsack Polytope is DP-complete. H Zhu arXiv e-prints, arXiv: 2211.03311, 2022 | | 2022 |
| Theory and Computation for Cutting-Plane Methods in Discrete Optimization H Zhu The University of Wisconsin-Madison, 2022 | | 2022 |
| Prediction modeling in sequential flow networks P Murali, H Zhu, DC Patel US Patent App. 16/797,394, 2021 | | 2021 |
| Multi-cover inequalities for totally-ordered multiple knapsack sets AD Pia, J Linderoth, H Zhu International Conference on Integer Programming and Combinatorial …, 2021 | | 2021 |
Jeff LinderothUniversity of Wisconsin-Madison. Wisconsin Institute for DiscoveryVerified email at wisc.edu
