| Year |
Citation |
Score |
| 2020 |
Kong Q, Li S, Liu N, Teo C, Yan Z. Appointment Scheduling Under Time-Dependent Patient No-Show Behavior Management Science. 66: 3480-3500. DOI: 10.1287/Mnsc.2019.3366 |
0.306 |
|
| 2020 |
Sun L, Lyu G, Yu Y, Teo C. Fulfillment by Amazon versus fulfillment by seller: An interpretable risk‐adjusted fulfillment model Naval Research Logistics. DOI: 10.1002/Nav.21897 |
0.316 |
|
| 2019 |
Shen H, Liang Y, Shen ZM, Teo C. Reliable Flexibility Design of Supply Chains Via Extended Probabilistic Expanders Production and Operations Management. 28: 700-720. DOI: 10.1111/Poms.12942 |
0.354 |
|
| 2018 |
Fu Q, Sim CK, Teo C. Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach Operations Research. 66: 500-513. DOI: 10.1287/Opre.2017.1677 |
0.375 |
|
| 2017 |
Zhong Y, Zheng Z, Chou MC, Teo C. Resource Pooling and Allocation Policies to Deliver Differentiated Service Management Science. 64: 1555-1573. DOI: 10.1287/Mnsc.2016.2674 |
0.316 |
|
| 2016 |
Zheng Z, Natarajan K, Teo C. Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty Operations Research. 64: 1406-1421. DOI: 10.1287/Opre.2016.1528 |
0.42 |
|
| 2016 |
Kong Q, Lee CY, Teo C, Zheng Z. Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal European Journal of Operational Research. 255: 809-821. DOI: 10.1016/J.Ejor.2016.06.004 |
0.337 |
|
| 2016 |
Natarajan K, Teo CP. On reduced semidefinite programs for second order moment bounds with applications Mathematical Programming. 1-32. DOI: 10.1007/S10107-016-1019-1 |
0.389 |
|
| 2015 |
Wang G, Zhong Y, Teo C, Liu Q. Flow-based accessibility measurement: The Place Rank approach Transportation Research Part C-Emerging Technologies. 56: 335-345. DOI: 10.1016/J.Trc.2015.04.017 |
0.3 |
|
| 2014 |
Mishra VK, Natarajan K, Padmanabhan D, Teo CP, Li X. On theoretical and empirical aspects of marginal distribution choice models Management Science. 60: 1511-1531. DOI: 10.1287/Mnsc.2014.1906 |
0.352 |
|
| 2014 |
Li X, Natarajan K, Teo CP, Zheng Z. Distributionally robust mixed integer linear programs: Persistency models with applications European Journal of Operational Research. 233: 459-473. DOI: 10.1016/J.Ejor.2013.07.009 |
0.434 |
|
| 2013 |
Shu J, Chou MC, Liu Q, Teo C, Wang I. Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems Operations Research. 61: 1346-1359. DOI: 10.1287/Opre.2013.1215 |
0.312 |
|
| 2012 |
Chou MC, Sim CK, Teo C, Zheng H. Newsvendor Pricing Problem in a Two‐Sided Market Production and Operations Management. 21: 204-208. DOI: 10.1111/J.1937-5956.2011.01235.X |
0.323 |
|
| 2012 |
Mishra VK, Natarajan K, Tao H, Teo C. Choice Prediction With Semidefinite Optimization When Utilities are Correlated Ieee Transactions On Automatic Control. 57: 2450-2463. DOI: 10.1109/Tac.2012.2211175 |
0.476 |
|
| 2011 |
Chou MC, Chua GA, Teo C, Zheng H. Process Flexibility Revisited: The Graph Expander and Its Applications Operations Research. 59: 1090-1105. DOI: 10.1287/Opre.1110.0987 |
0.372 |
|
| 2010 |
Chen W, Sim M, Sun J, Teo C. From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization Operations Research. 58: 470-485. DOI: 10.1287/Opre.1090.0712 |
0.515 |
|
| 2010 |
Chou MC, Chua GA, Teo C, Zheng H. Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure Operations Research. 58: 43-58. DOI: 10.1287/Opre.1080.0664 |
0.385 |
|
| 2010 |
Bertsimas D, Doan XV, Natarajan K, Teo C. Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion Mathematics of Operations Research. 35: 580-602. DOI: 10.1287/Moor.1100.0445 |
0.648 |
|
| 2010 |
Ding D, Teo C. World Container Port Throughput Follows Lognormal Distribution Maritime Policy & Management. 37: 401-426. DOI: 10.1080/03088839.2010.485211 |
0.319 |
|
| 2009 |
Natarajan K, Song M, Teo C. Persistency Model and Its Applications in Choice Modeling Management Science. 55: 453-469. DOI: 10.1287/Mnsc.1080.0951 |
0.515 |
|
| 2009 |
Shen ZJM, Shu J, Simchi-Levi D, Teo CP, Zhang J. Approximation algorithms for general one-warehouse multi-retailer systems Naval Research Logistics. 56: 642-658. DOI: 10.1002/Nav.20367 |
0.502 |
|
| 2007 |
Romeijn HE, Shu J, Teo CP. Designing two-echelon supply networks European Journal of Operational Research. 178: 449-462. DOI: 10.1016/J.Ejor.2006.02.016 |
0.404 |
|
| 2006 |
Sethuraman J, Teo CP, Qian L. Many-to-one stable matching: Geometry and fairness Mathematics of Operations Research. 31: 581-596. DOI: 10.1287/Moor.1060.0207 |
0.627 |
|
| 2006 |
Bertsimas D, Natarajan K, Teo C. TIGHT BOUNDS ON EXPECTED ORDER STATISTICS Probability in the Engineering and Informational Sciences. 20: 667-686. DOI: 10.1017/S0269964806060414 |
0.541 |
|
| 2006 |
Magnanti TL, Shen ZJM, Shu J, Simchi-Levi D, Teo CP. Inventory placement in acyclic supply chain networks Operations Research Letters. 34: 228-238. DOI: 10.1016/J.Orl.2005.04.004 |
0.421 |
|
| 2006 |
Sethuraman J, Teo CP, Vohra RV. Anonymous monotonic social welfare functions Journal of Economic Theory. 128: 232-254. DOI: 10.1016/J.Jet.2004.11.006 |
0.565 |
|
| 2006 |
Bertsimas D, Natarajan K, Teo C. Persistence in discrete optimization under data uncertainty Mathematical Programming. 108: 251-274. DOI: 10.1007/S10107-006-0710-Z |
0.631 |
|
| 2006 |
Moorthy R, Teo C. Berth management in container terminal: the template design problem Or Spectrum. 28: 495-518. DOI: 10.1007/S00291-006-0036-5 |
0.46 |
|
| 2005 |
Hum SH, Sharafali M, Teo CP. Staggering periodic replenishment in multivendor JIT environments Operations Research. 53: 698-710. DOI: 10.1287/Opre.1040.0196 |
0.515 |
|
| 2005 |
Shu J, Teo C, Shen ZM. Stochastic Transportation-Inventory Network Design Problem Operations Research. 53: 48-60. DOI: 10.1287/Opre.1040.0140 |
0.531 |
|
| 2004 |
Teo CP, Shu J. Warehouse-retailer network design problem Operations Research. 52. DOI: 10.1287/Opre.1030.0096 |
0.488 |
|
| 2004 |
Bertsimas D, Natarajan K, Teo C. Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds Siam Journal On Optimization. 15: 185-209. DOI: 10.1137/S1052623403430610 |
0.646 |
|
| 2003 |
Sethuraman J, Teo CP. Effective routing and scheduling in adversarial queueing networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2764: 153-164. DOI: 10.1007/S00453-005-1162-1 |
0.606 |
|
| 2002 |
Chan LMA, Muriel A, Shen ZM, Simchi-Levi D, Teo C. Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures Management Science. 48: 1446-1460. DOI: 10.1287/Mnsc.48.11.1446.267 |
0.385 |
|
| 2002 |
Teo C, Leong SM. Managing Risk in a Four-Digit Number Game Siam Review. 44: 601-615. DOI: 10.1137/S00361445003669 |
0.304 |
|
| 2001 |
Teo C, Bertsimas D. Multistage Lot Sizing Problems via Randomized Rounding Operations Research. 49: 599-608. DOI: 10.1287/Opre.49.4.599.11222 |
0.624 |
|
| 2001 |
Teo C, Sethuraman J, Tan W. Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications Management Science. 47: 1252-1267. DOI: 10.1287/Mnsc.47.9.1252.9784 |
0.582 |
|
| 2001 |
Srinivasan A, Teo C. A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria Siam Journal On Computing. 30: 2051-2068. DOI: 10.1137/S0097539798335596 |
0.449 |
|
| 2001 |
Chen FY, Goh M, Lee J, Ou J, Sharafali M, Teo C, Goh P, Sivanathan P. St Logistics: Distributing Consumer Goods in China International Transactions in Operational Research. 8: 203-219. DOI: 10.1111/1475-3995.00260 |
0.308 |
|
| 2001 |
Chew K, Pang J, Liu Q, Ou J, Teo C. An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT Annals of Operations Research. 108: 111-122. DOI: 10.1023/A:1016002910561 |
0.322 |
|
| 2001 |
Sethuraman J, Teo CP. A polynomial-time algorithm for the bistable roommates problem Journal of Computer and System Sciences. 63: 486-497. DOI: 10.1006/Jcss.2001.1791 |
0.675 |
|
| 2000 |
Teo CP, Sethuraman J. On a cutting plane heuristic for the stable roommates problem and its applications European Journal of Operational Research. 123: 195-205. DOI: 10.1016/S0377-2217(99)00049-1 |
0.673 |
|
| 1999 |
Bertsimas D, Teo C, Vohra R. On dependent randomized rounding algorithms Operations Research Letters. 24: 105-114. DOI: 10.1016/S0167-6377(99)00010-3 |
0.631 |
|
| 1999 |
Bertsimas D, Teo C, Vohra R. Analysis of LP relaxations for multiway and multicut problems Networks. 34: 102-114. DOI: 10.1002/(Sici)1097-0037(199909)34:2<102::Aid-Net3>3.0.Co;2-X |
0.636 |
|
| 1998 |
Bertsimas D, Teo C. From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems Operations Research. 46: 503-514. DOI: 10.1287/Opre.46.4.503 |
0.639 |
|
| 1998 |
Teo CP, Sethuraman J. The geometry of fractional stable matchings and its applications Mathematics of Operations Research. 23: 874-891. DOI: 10.1287/Moor.23.4.874 |
0.668 |
|
| Show low-probability matches. |