default search action
Chung-Piaw Teo
Person information
- affiliation: National University of Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j74]Baris Ata, Lin William Cong, Kay Giesecke, Peng Sun, Chung-Piaw Teo:
Call for Papers - Management Science Virtual Special Issue on AI for Finance and Business Decisions. Manag. Sci. 70(10): xi-xii (2024) - [j73]Guodong Lyu
, Wang Chi Cheung
Multiobjective Stochastic Optimization: A Case of Real-Time Matching in Ride-Sourcing Markets. Manuf. Serv. Oper. Manag. 26(2): 500-518 (2024) - [j72]Yanlu Zhao
Market Thickness in Online Food Delivery Platforms: The Impact of Food Processing Times. Manuf. Serv. Oper. Manag. 26(3): 853-872 (2024) - [i3]Wei Wu, Liang Tang, Zhongjie Zhao, Chung-Piaw Teo:
Enhancing binary classification: A new stacking method via leveraging computational geometry. CoRR abs/2410.22722 (2024) - 2023
- [j71]Jinpeng Liang
Online Passenger Flow Control in Metro Lines. Oper. Res. 71(2): 768-775 (2023) - [j70]Eryn Juan He
Off-Platform Threats in On-Demand Services. Manuf. Serv. Oper. Manag. 25(2): 775-791 (2023) - [j69]Sheng Bi
Taming the Long Tail: The Gambler's Fallacy in Intermittent Demand Management. Manuf. Serv. Oper. Manag. 25(5): 1692-1710 (2023) - 2022
- [j68]Guodong Lyu
Stochastic Knapsack Revisited: The Service Level Perspective. Oper. Res. 70(2): 729-747 (2022) - [j67]Xiaobo Li
Convex Optimization for Bundle Size Pricing Problem. Manag. Sci. 68(2): 1095-1106 (2022) - [j66]Kay Giesecke
Introduction to the Special Section on Data-Driven Prescriptive Analytics. Manag. Sci. 68(3): 1591-1594 (2022) - [j65]Zhenzhen Yan
A Representative Consumer Model in Data-Driven Multiproduct Pricing Optimization. Manag. Sci. 68(8): 5798-5827 (2022) - [j64]Sameer Hasija, Chung-Piaw Teo:
Introduction to the Special Section on Smart City Operations. Manuf. Serv. Oper. Manag. 24(5): 2387-2388 (2022) - [j63]Guodong Lyu
Last Mile Innovation: The Case of the Locker Alliance Network. Manuf. Serv. Oper. Manag. 24(5): 2425-2443 (2022) - [j62]Huan Zheng
From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs. Manuf. Serv. Oper. Manag. 24(6): 2901-2924 (2022) - 2021
- [j61]Peng Liu
Limousine Service Management: Capacity Planning with Predictive Analytics and Optimization. INFORMS J. Appl. Anal. 51(4): 280-296 (2021) - [j60]Will Ma
On Policies for Single-Leg Revenue Management with Limited Demand Information. Oper. Res. 69(1): 207-226 (2021) - [j59]Libo Sun
Cross-Border E-Commerce Data Set: Choosing the Right Fulfillment Option. Manuf. Serv. Oper. Manag. 23(5): 1297-1313 (2021) - [c12]Jinjia Huang, Mabel C. Chou, Chung-Piaw Teo:
Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice Restriction. AAAI 2021: 11844-11852 - 2020
- [j58]Qingxia Kong
Judgment Error in Lottery Play: When the Hot Hand Meets the Gambler's Fallacy. Manag. Sci. 66(2): 844-862 (2020) - [j57]Qingxia Kong
Appointment Scheduling Under Time-Dependent Patient No-Show Behavior. Manag. Sci. 66(8): 3480-3500 (2020) - [j56]Sameer Hasija
Smart City Operations: Modeling Challenges and Opportunities. Manuf. Serv. Oper. Manag. 22(1): 203-213 (2020) - [c11]Xiaobo Li, Hailong Sun, Chung-Piaw Teo:
Convex Optimization for Bundle Size Pricing Problem. EC 2020: 637-638 - [i2]Ying Chen, Peng Liu, Chung-Piaw Teo:
Regularised Text Logistic Regression: Key Word Detection and Sentiment Classification for Online Reviews. CoRR abs/2009.04591 (2020)
2010 – 2019
- 2019
- [j55]Mabel C. Chou
Material and Cash Flow in Two-Tier Supply Chain with Trade Credits and Defaults. Found. Trends Technol. Inf. Oper. Manag. 12(2-3): 119-134 (2019) - [j54]Sarah Yini Gao
Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited. Oper. Res. 67(3): 831-852 (2019) - [j53]Guodong Lyu
Capacity Allocation in Flexible Production Networks: Theory and Applications. Manag. Sci. 65(11): 5091-5109 (2019) - 2018
- [j52]Qi Fu
Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach. Oper. Res. 66(2): 500-513 (2018) - [j51]Yuanguang Zhong, Zhichao Zheng
Resource Pooling and Allocation Policies to Deliver Differentiated Service. Manag. Sci. 64(4): 1555-1573 (2018) - [j50]Kay Giesecke, Gui Liberali, Hamid Nazerzadeh, J. George Shanthikumar, Chung-Piaw Teo:
Call for Papers - Management Science - Special Issue on Data-Driven Prescriptive Analytics. Manag. Sci. 64(6): 2972 (2018) - [j49]Zhenzhen Yan
On the Design of Sparse but Efficient Structures in Operations. Manag. Sci. 64(7): 3421-3445 (2018) - [i1]Will Ma, David Simchi-Levi, Chung-Piaw Teo:
On Policies for Single-leg Revenue Management with Limited Demand Information. CoRR abs/1810.10900 (2018) - 2017
- [j48]Karthik Natarajan
On reduced semidefinite programs for second order moment bounds with applications. Math. Program. 161(1-2): 487-518 (2017) - 2016
- [j47]Qingxia Kong
Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal. Eur. J. Oper. Res. 255(3): 809-821 (2016) - [j46]Zhichao Zheng
Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty. Oper. Res. 64(6): 1406-1421 (2016) - 2014
- [j45]Xiaobo Li, Karthik Natarajan
Distributionally robust mixed integer linear programs: Persistency models with applications. Eur. J. Oper. Res. 233(3): 459-473 (2014) - [j44]Vinit Kumar Mishra, Karthik Natarajan
On Theoretical and Empirical Aspects of Marginal Distribution Choice Models. Manag. Sci. 60(6): 1511-1531 (2014) - 2013
- [j43]Qingxia Kong
Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones. Oper. Res. 61(3): 711-726 (2013) - [j42]Jia Shu, Mabel C. Chou
Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems. Oper. Res. 61(6): 1346-1359 (2013) - 2012
- [j41]Vinit Kumar Mishra, Karthik Natarajan
Choice Prediction With Semidefinite Optimization When Utilities are Correlated. IEEE Trans. Autom. Control. 57(10): 2450-2463 (2012) - 2011
- [j40]Karthik Natarajan
Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation. Oper. Res. 59(3): 713-728 (2011) - [j39]Mabel C. Chou
Process Flexibility Revisited: The Graph Expander and Its Applications. Oper. Res. 59(5): 1090-1105 (2011) - 2010
- [j38]Mabel C. Chou
On range and response: Dimensions of process flexibility. Eur. J. Oper. Res. 207(2): 711-724 (2010) - [j37]Mabel C. Chou
Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure. Oper. Res. 58(1): 43-58 (2010) - [j36]Wenqing Chen, Melvyn Sim
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization. Oper. Res. 58(2): 470-485 (2010) - [j35]Dimitris Bertsimas, Xuan Vinh Doan, Karthik Natarajan
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion. Math. Oper. Res. 35(3): 580-602 (2010)
2000 – 2009
- 2009
- [j34]Karthik Natarajan
Persistency Model and Its Applications in Choice Modeling. Manag. Sci. 55(3): 453-469 (2009) - 2007
- [j33]H. Edwin Romeijn, Jia Shu, Chung-Piaw Teo
Designing two-echelon supply networks. Eur. J. Oper. Res. 178(2): 449-462 (2007) - [j32]Lawrence V. Snyder, Mark S. Daskin
The stochastic location model with risk pooling. Eur. J. Oper. Res. 179(3): 1221-1238 (2007) - 2006
- [j31]Jay Sethuraman, Chung-Piaw Teo
Anonymous monotonic social welfare functions. J. Econ. Theory 128(1): 232-254 (2006) - [j30]Jay Sethuraman, Chung-Piaw Teo
Many-to-One Stable Matching: Geometry and Fairness. Math. Oper. Res. 31(3): 581-596 (2006) - [j29]Dimitris Bertsimas, Karthik Natarajan
Persistence in discrete optimization under data uncertainty. Math. Program. 108(2-3): 251-274 (2006) - [j28]Thomas L. Magnanti, Zuo-Jun Max Shen
Inventory placement in acyclic supply chain networks. Oper. Res. Lett. 34(2): 228-238 (2006) - [j27]Rajeeva Moorthy, Chung-Piaw Teo
Berth management in container terminal: the template design problem. OR Spectr. 28(4): 495-518 (2006) - 2005
- [j26]Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. Algorithmica 43(1-2): 133-146 (2005) - [j25]Jia Shu, Chung-Piaw Teo
Stochastic Transportation-Inventory Network Design Problem. Oper. Res. 53(1): 48-60 (2005) - [j24]Sin-Hoon Hum, Moosa Sharafali, Chung-Piaw Teo
Staggering Periodic Replenishment in Multivendor JIT Environments. Oper. Res. 53(4): 698-710 (2005) - [j23]Seyes M. R. Iravani, Chung-Piaw Teo
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. Oper. Res. Lett. 33(4): 421-430 (2005) - 2004
- [j22]Chung-Piaw Teo
Warehouse-Retailer Network Design Problem. Oper. Res. 52(3): 396-408 (2004) - [j21]Dimitris Bertsimas, Karthik Natarajan
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds. SIAM J. Optim. 15(1): 185-209 (2004) - 2003
- [j20]Wei-Shi Lim, Jihong Ou, Chung-Piaw Teo
Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems. Oper. Res. 51(4): 668-672 (2003) - [j19]Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra:
Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28(2): 309-326 (2003) - [c10]Jay Sethuraman, Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks. RANDOM-APPROX 2003: 153-164 - 2002
- [j18]Lap Mui Ann Chan, Ana Muriel, Zuo-Jun Max Shen
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures. Manag. Sci. 48(11): 1446-1460 (2002) - [j17]Chung-Piaw Teo
Managing Risk in a Four-Digit Number Game. SIAM Rev. 44(4): 601-615 (2002) - [c9]Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra:
Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211 - 2001
- [j16]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. Ann. Oper. Res. 108(1-4): 111-122 (2001) - [j15]Chung-Piaw Teo
Multistage Lot Sizing Problems via Randomized Rounding. Oper. Res. 49(4): 599-608 (2001) - [j14]Jay Sethuraman, Chung-Piaw Teo
A Polynomial-time Algorithm for the Bistable Roommates Problem. J. Comput. Syst. Sci. 63(3): 486-497 (2001) - [j13]Chung-Piaw Teo
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. Manag. Sci. 47(9): 1252-1267 (2001) - 2000
- [j12]Chung-Piaw Teo
On a cutting plane heuristic for the stable roommates problem and its applications. Eur. J. Oper. Res. 123(1): 195-205 (2000) - [j11]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)
1990 – 1999
- 1999
- [j10]Dimitris Bertsimas, Chung-Piaw Teo
Analysis of LP relaxations for multiway and multicut problems. Networks 34(2): 102-114 (1999) - [j9]Dimitris Bertsimas, Chung-Piaw Teo
On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3): 105-114 (1999) - [c8]Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan:
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. IPCO 1999: 429-438 - 1998
- [j8]Dimitris Bertsimas, Chung-Piaw Teo
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems. Oper. Res. 46(4): 503-514 (1998) - [j7]Chung-Piaw Teo
The Geometry of Fractional Stable Matchings and Its Applications. Math. Oper. Res. 23(4): 874-891 (1998) - [c7]Chung-Piaw Teo, Jihong Ou, Kok-Choon Tan:
Multi-Item Inventory Staggering Problems: Heuristic and Bounds. SODA 1998: 584-593 - 1997
- [j6]Dimitris Bertsimas, Chung-Piaw Teo:
The parsimonious property of cut covering problems and its applications. Oper. Res. Lett. 21(3): 123-132 (1997) - [c6]Chung-Piaw Teo, Jay Sethuraman:
LP Based Approach to Optimal Stable Matchings. SODA 1997: 710-719 - [c5]Aravind Srinivasan, Chung-Piaw Teo:
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. STOC 1997: 636-643 - 1996
- [j5]Khee Meng Koh, Chung-Piaw Teo:
Chromaticity of series-parallel graphs. Discret. Math. 154(1-3): 289-295 (1996) - [c4]Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra:
On Dependent Randomized Rounding Algorithms. IPCO 1996: 330-344 - [c3]Chung-Piaw Teo, Dimitris Bertsimas:
Improved Randomized Approximation Algorithms for Lot-Sizing Problems. IPCO 1996: 359-373 - 1995
- [c2]Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra:
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. IPCO 1995: 29-39 - [c1]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 - 1994
- [j4]Chung-Piaw Teo
On chromatic uniqueness of uniform subdivisions of graphs. Discret. Math. 128(1-3): 327-335 (1994) - 1992
- [j3]Chung-Piaw Teo
The number of shortest cycles and the chromatic uniqueness of a graph. J. Graph Theory 16(1): 7-15 (1992) - 1991
- [j2]Khee Meng Koh, Chung-Piaw Teo
The chromatic uniqueness of certain broken wheels. Discret. Math. 96(1): 65-69 (1991) - 1990
- [j1]Chung-Piaw Teo
The chromaticity of complete bipartite graphs with at most one edge deleted. J. Graph Theory 14(1): 89-99 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: