13 citations · 24 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.OC2014★ 2 cited
Sorting Network Relaxations for Vector Permutation Problems
Cong Han Lim, Stephen J. Wright
The Birkhoff polytope (the convex hull of the set of permutation matrices) is frequently invoked in formulating relaxations of optimization problems over permutations. The Birkhoff…
stat.OT2014★ 6 cited
Validating Sample Average Approximation Solutions with Negatively Dependent Batches
Jiajie Chen, Cong Han Lim, Peter Z. G. Qian +2
Sample-average approximations (SAA) are a practical means of finding approximate solutions of stochastic programming problems involving an extremely large (or infinite) number of s…