|
Search the dblp DataBase
Chung-Piaw Teo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:29-39 [Conf]
- Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
On Dependent Randomized Rounding Algorithms. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:330-344 [Conf]
- Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra
Integer Programming and Arrovian Social Welfare Functions. [Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:194-211 [Conf]
- Chung-Piaw Teo, Dimitris Bertsimas
Improved Randomized Approximation Algorithms for Lot-Sizing Problems. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:359-373 [Conf]
- Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:429-438 [Conf]
- Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:153-164 [Conf]
- Dimitris Bertsimas, Chung-Piaw Teo
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:102-111 [Conf]
- Chung-Piaw Teo, Jihong Ou, Kok-Choon Tan
Multi-Item Inventory Staggering Problems: Heuristic and Bounds. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:584-593 [Conf]
- Chung-Piaw Teo, Jay Sethuraman
LP Based Approach to Optimal Stable Matchings. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:710-719 [Conf]
- Aravind Srinivasan, Chung-Piaw Teo
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. [Citation Graph (0, 0)][DBLP] STOC, 1997, pp:636-643 [Conf]
- Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:1-2, pp:133-146 [Journal]
- Jay Sethuraman, Chung-Piaw Teo
A Polynomial-time Algorithm for the Bistable Roommates Problem. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:63, n:3, pp:486-497 [Journal]
- Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
Integer Programming and Arrovian Social Welfare Functions. [Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2003, v:28, n:2, pp:309-326 [Journal]
- Dimitris Bertsimas, Karthik Natarajan, Chung-Piaw Teo
Persistence in discrete optimization under data uncertainty. [Citation Graph (0, 0)][DBLP] Math. Program., 2006, v:108, n:2-3, pp:251-274 [Journal]
- Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
Analysis of LP relaxations for multiway and multicut problems. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:2, pp:102-114 [Journal]
- Dimitris Bertsimas, Chung-Piaw Teo
The parsimonious property of cut covering problems and its applications. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:3, pp:123-132 [Journal]
- Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
On dependent randomized rounding algorithms. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:24, n:3, pp:105-114 [Journal]
- Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, David Simchi-Levi, Chung-Piaw Teo
Inventory placement in acyclic supply chain networks. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:2, pp:228-238 [Journal]
- Aravind Srinivasan, Chung-Piaw Teo
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:2051-2068 [Journal]
- H. Edwin Romeijn, Jia Shu, Chung-Piaw Teo
Designing two-echelon supply networks. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:449-462 [Journal]
- Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo
The stochastic location model with risk pooling. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:1221-1238 [Journal]
Search in 0.003secs, Finished in 0.004secs
|