| Strong mixed-integer programming formulations for trained neural networks R Anderson, J Huchette, W Ma, C Tjandraatmadja, JP Vielma Mathematical Programming 183 (1), 3-39, 2020 | 289 | 2020 |
| Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios W Ma, D Simchi-Levi Operations Research, 2020 | 99* | 2020 |
| The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification C Tjandraatmadja, R Anderson, J Huchette, W Ma, KK Patel, JP Vielma Advances in Neural Information Processing Systems 33, 21675-21686, 2020 | 87 | 2020 |
| Improvements and generalizations of stochastic knapsack and markovian bandits approximation algorithms W Ma Mathematics of Operations Research 43 (3), 789-812, 2018 | 87* | 2018 |
| Dynamic pricing (and assortment) under a static calendar W Ma, D Simchi-Levi, J Zhao Management Science 67 (4), 2292-2313, 2021 | 59* | 2021 |
| Assortment planning for recommendations at checkout under inventory constraints X Chen, W Ma, D Simchi-Levi, L Xin Mathematics of Operations Research 49 (1), 297-325, 2024 | 48* | 2024 |
| Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack∗ J Jiang, W Ma, J Zhang Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 45 | 2022 |
| Group-level fairness maximization in online bipartite matching W Ma, P Xu, Y Xu arXiv preprint arXiv:2011.13908, 2020 | 40 | 2020 |
| Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources J Baek, W Ma Operations Research 70 (4), 2226-2236, 2022 | 37 | 2022 |
| Distributionally robust linear and discrete optimization with marginals L Chen, W Ma, K Natarajan, D Simchi-Levi, Z Yan Operations Research 70 (3), 1822-1834, 2022 | 37 | 2022 |
| Tight guarantees for static threshold policies in the prophet secretary problem N Arnosti, W Ma Operations research 71 (5), 1777-1788, 2023 | 31 | 2023 |
| Reaping the benefits of bundling under high production costs W Ma, D Simchi-Levi International Conference on Artificial Intelligence and Statistics, 1342-1350, 2021 | 31 | 2021 |
| Multi-stage and multi-customer assortment optimization with inventory constraints E Fata, W Ma, D Simchi-Levi arXiv preprint arXiv:1908.09808, 2019 | 31 | 2019 |
| Inventory balancing with online learning WC Cheung, W Ma, D Simchi-Levi, X Wang Management Science 68 (3), 1776-1807, 2022 | 28 | 2022 |
| Online matching frameworks under stochastic rewards, product ranking, and unknown patience B Brubach, N Grammel, W Ma, A Srinivasan Operations Research, 2023 | 27* | 2023 |
| Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model B Jin, W Ma Advances in Neural Information Processing Systems 35, 14555-14567, 2022 | 27 | 2022 |
| Improved guarantees for offline stochastic matching via new ordered contention resolution schemes B Brubach, N Grammel, W Ma, A Srinivasan Advances in Neural Information Processing Systems 34, 27184-27195, 2021 | 21 | 2021 |
| Fairness maximization among offline agents in online-matching markets W Ma, P Xu, Y Xu ACM Transactions on Economics and Computation 10 (4), 1-27, 2023 | 20 | 2023 |
| On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs C MacRury, W Ma, N Grammel Operations Research, 2024 | 19 | 2024 |
| A nonparametric framework for online stochastic matching with correlated arrivals A Aouad, W Ma arXiv preprint arXiv:2208.02229, 2022 | 18 | 2022 |
