Will Ma
Will Ma
Verified email at gsb.columbia.edu
Cited by
Cited by
Strong mixed-integer programming formulations for trained neural networks
R Anderson, J Huchette, W Ma, C Tjandraatmadja, JP Vielma
Mathematical Programming, 1-37, 2020
Improvements and generalizations of stochastic knapsack and markovian bandits approximation algorithms
W Ma
Mathematics of Operations Research 43 (3), 789-812, 2018
Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios
W Ma, D Simchi-Levi
Operations Research, 2020
Assortment Planning for Recommendations at Checkout under Inventory Constraints
X Chen, W Ma, D Simchi-Levi, L Xin
Available at SSRN 2853093, 2016
Dynamic pricing (and assortment) under a static calendar
W Ma, D Simchi-Levi, J Zhao
Management Science 67 (4), 2292-2313, 2021
Reaping the benefits of bundling under high production costs
W Ma, D Simchi-Levi
International Conference on Artificial Intelligence and Statistics, 1342-1350, 2021
Packing and covering triangles in planar graphs
Q Cui, P Haxell, W Ma
Graphs and Combinatorics 25 (6), 817-824, 2009
The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification
C Tjandraatmadja, R Anderson, J Huchette, W Ma, K Patel, JP Vielma
arXiv preprint arXiv:2006.14076, 2020
Multi-stage and multi-customer assortment optimization with inventory constraints
E Fata, W Ma, D Simchi-Levi
Available at SSRN 3443109, 2019
Inventory balancing with online learning
WC Cheung, W Ma, D Simchi-Levi, X Wang
arXiv preprint arXiv:1810.05640, 2018
Distributionally robust linear and discrete optimization with marginals
L Chen, W Ma, K Natarajan, D Simchi-Levi, Z Yan
Available at SSRN 3159473, 2018
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience
B Brubach, N Grammel, W Ma, A Srinivasan
arXiv preprint arXiv:1907.03963, 2019
Group-level Fairness Maximization in Online Bipartite Matching
W Ma, P Xu
arXiv preprint arXiv:2011.13908, 2020
On policies for single-leg revenue management with limited demand information
W Ma, D Simchi-Levi, CP Teo
Operations Research 69 (1), 207-226, 2021
Separation between second price auctions with personalized reserves and the revenue optimal auction
W Ma, B Sivan
Operations Research Letters 48 (2), 176-179, 2020
Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources
J Baek, W Ma
Available at SSRN 3482457, 2019
A Competitive Analysis of Online Knapsack Problems with Unit Density
W Ma, D Simchi-Levi, J Zhao
SSRN Electronic Journal, 2019
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items
W Ma
International Conference on Web and Internet Economics, 162-176, 2020
Predicting user choice in video games
A Khandelwal, W Ma, D Simchi-Levi
Presentation at the INFORMS RMP Conference, 2017
Distributionally robust max flows
LL Chen, W Ma, JB Orlin, D Simchi-Levi
Symposium on Simplicity in Algorithms, 81-90, 2020
The system can't perform the operation now. Try again later.
Articles 1–20