 | 2007 |
| 27 |  | H. Edwin Romeijn,
Jia Shu,
Chung-Piaw Teo:
Designing two-echelon supply networks.
European Journal of Operational Research 178(2): 449-462 (2007) |
| 26 |  | Lawrence V. Snyder,
Mark S. Daskin,
Chung-Piaw Teo:
The stochastic location model with risk pooling.
European Journal of Operational Research 179(3): 1221-1238 (2007) |
| 2006 |
| 25 |  | Jay Sethuraman,
Chung-Piaw Teo,
Liwen Qian:
Many-to-One Stable Matching: Geometry and Fairness.
Math. Oper. Res. 31(3): 581-596 (2006) |
| 24 |  | Dimitris Bertsimas,
Karthik Natarajan,
Chung-Piaw Teo:
Persistence in discrete optimization under data uncertainty.
Math. Program. 108(2-3): 251-274 (2006) |
| 23 |  | Thomas L. Magnanti,
Zuo-Jun Max Shen,
Jia Shu,
David Simchi-Levi,
Chung-Piaw Teo:
Inventory placement in acyclic supply chain networks.
Oper. Res. Lett. 34(2): 228-238 (2006) |
| 2005 |
| 22 |  | Jay Sethuraman,
Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks.
Algorithmica 43(1-2): 133-146 (2005) |
| 21 |  | Jia Shu,
Chung-Piaw Teo,
Zuo-Jun Max Shen:
Stochastic Transportation-Inventory Network Design Problem.
Operations Research 53(1): 48-60 (2005) |
| 20 |  | Sin-Hoon Hum,
Moosa Sharafali,
Chung-Piaw Teo:
Staggering Periodic Replenishment in Multivendor JIT Environments.
Operations Research 53(4): 698-710 (2005) |
| 2004 |
| 19 |  | Chung-Piaw Teo,
Jia Shu:
Warehouse-Retailer Network Design Problem.
Operations Research 52(3): 396-408 (2004) |
| 2003 |
| 18 |  | Jay Sethuraman,
Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks.
RANDOM-APPROX 2003: 153-164 |
| 17 |  | Jay Sethuraman,
Chung-Piaw Teo,
Rakesh V. Vohra:
Integer Programming and Arrovian Social Welfare Functions.
Math. Oper. Res. 28(2): 309-326 (2003) |
| 16 |  | Wei-Shi Lim,
Jihong Ou,
Chung-Piaw Teo:
Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems.
Operations Research 51(4): 668-672 (2003) |
| 2002 |
| 15 |  | Jay Sethuraman,
Chung-Piaw Teo,
Rakesh Vohra:
Integer Programming and Arrovian Social Welfare Functions.
IPCO 2002: 194-211 |
| 2001 |
| 14 |  | Kim-Lin Chew,
Johnny Pang,
Qizhang Liu,
Jihong Ou,
Chung-Piaw Teo:
An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT.
Annals OR 108(1-4): 111-122 (2001) |
| 13 |  | Jay Sethuraman,
Chung-Piaw Teo:
A Polynomial-time Algorithm for the Bistable Roommates Problem.
J. Comput. Syst. Sci. 63(3): 486-497 (2001) |
| 2000 |
| 12 |  | Aravind Srinivasan,
Chung-Piaw Teo:
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.
SIAM J. Comput. 30(6): 2051-2068 (2000) |
| 1999 |
| 11 |  | Chung-Piaw Teo,
Jay Sethuraman,
Wee-Peng Tan:
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.
IPCO 1999: 429-438 |
| 10 |  | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
Analysis of LP relaxations for multiway and multicut problems.
Networks 34(2): 102-114 (1999) |
| 9 |  | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
On dependent randomized rounding algorithms.
Oper. Res. Lett. 24(3): 105-114 (1999) |
| 1998 |
| 8 |  | Chung-Piaw Teo,
Jihong Ou,
Kok-Choon Tan:
Multi-Item Inventory Staggering Problems: Heuristic and Bounds.
SODA 1998: 584-593 |
| 1997 |
| 7 |  | Chung-Piaw Teo,
Jay Sethuraman:
LP Based Approach to Optimal Stable Matchings.
SODA 1997: 710-719 |
| 6 |  | Aravind Srinivasan,
Chung-Piaw Teo:
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria.
STOC 1997: 636-643 |
| 5 |  | Dimitris Bertsimas,
Chung-Piaw Teo:
The parsimonious property of cut covering problems and its applications.
Oper. Res. Lett. 21(3): 123-132 (1997) |
| 1996 |
| 4 |  | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
On Dependent Randomized Rounding Algorithms.
IPCO 1996: 330-344 |
| 3 |  | Chung-Piaw Teo,
Dimitris Bertsimas:
Improved Randomized Approximation Algorithms for Lot-Sizing Problems.
IPCO 1996: 359-373 |
| 1995 |
| 2 |  | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.
IPCO 1995: 29-39 |
| 1 |  | Dimitris Bertsimas,
Chung-Piaw Teo:
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems.
SODA 1995: 102-111 |