On approximations of data-driven chance constrained programs over Wasserstein balls
|
2023 |
Chen, Zhi |
Bidding to procure supply in newsvendor networks
|
2023 |
Cakici, Ozden Engin |
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
|
2023 |
Grout, Logan |
Random assignments with uniform preferences : an impossibility result
|
2023 |
Ranjbar, Homa Hosseinzadeh |
A min-max theorem for the minimum fleet-size problem
|
2023 |
Ye, Tinghan |
Can partial cooperation between developed and developing countries be stable?
|
2023 |
Su, Shimai |
Online learning for route planning with on-time arrival reliability
|
2023 |
Jiang, Hongyi |
Absorbing games with irrational values
|
2023 |
Oliu-Barton, Miquel |
Optimal switching policy for batch servers
|
2023 |
Han, Yinbin |
Reducibility bounds of objective functions over the integers
|
2023 |
Eisenbrand, Friedrich |
On the duration of a gambler's ruin problem
|
2023 |
Ross, Sheldon M. |
On complexity of finding strong-weak solutions in bilevel linear programming
|
2023 |
Lagos, Tomás |
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure
|
2023 |
Chen, Yajing |
On the softplus penalty for large-scale convex optimization
|
2023 |
Li, Meng |
Comparing perspective reformulations for piecewise-convex optimization
|
2023 |
Trindade, Renan Spencer |
An optimal algorithm for the minimum-width cubic shell problem
|
2023 |
Bae, Sang Won |
The finagle point is close to the yolk
|
2023 |
Nganmeni, Zéphirin |
Solving nonlinear equations with the convex combination of two positive spectral coefficients
|
2023 |
Mohammad, Hassan |
Online cardinality constrained scheduling
|
2023 |
Epstein, Leah |
Supply chain coordination by manufacturer reward contract
|
2023 |
Zhang, Yuxiang |