Chung-Piaw Teo
Orcid: 0000-0002-0534-6858Affiliations:
- National University of Singapore
According to our database1,
Chung-Piaw Teo
authored at least 80 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Market Thickness in Online Food Delivery Platforms: The Impact of Food Processing Times.
Manuf. Serv. Oper. Manag., 2024
Multiobjective Stochastic Optimization: A Case of Real-Time Matching in Ride-Sourcing Markets.
Manuf. Serv. Oper. Manag., 2024
Call for Papers - <i>Management Science</i> Virtual Special Issue on AI for Finance and Business Decisions.
Manag. Sci., 2024
2023
Manuf. Serv. Oper. Manag., September, 2023
2022
Manuf. Serv. Oper. Manag., 2022
Manuf. Serv. Oper. Manag., 2022
Manuf. Serv. Oper. Manag., 2022
Manag. Sci., 2022
Manag. Sci., 2022
2021
Manuf. Serv. Oper. Manag., 2021
Oper. Res., 2021
Limousine Service Management: Capacity Planning with Predictive Analytics and Optimization.
INFORMS J. Appl. Anal., 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Manuf. Serv. Oper. Manag., 2020
Manag. Sci., 2020
Manag. Sci., 2020
Regularised Text Logistic Regression: Key Word Detection and Sentiment Classification for Online Reviews.
CoRR, 2020
2019
Manag. Sci., 2019
Oper. Res., 2019
Found. Trends Technol. Inf. Oper. Manag., 2019
2018
Manag. Sci., 2018
Call for Papers - <i>Management Science</i> - Special Issue on Data-Driven Prescriptive Analytics.
Manag. Sci., 2018
Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach.
Oper. Res., 2018
2017
Math. Program., 2017
2016
Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty.
Oper. Res., 2016
Eur. J. Oper. Res., 2016
2014
Manag. Sci., 2014
Distributionally robust mixed integer linear programs: Persistency models with applications.
Eur. J. Oper. Res., 2014
2013
Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems.
Oper. Res., 2013
Oper. Res., 2013
2012
IEEE Trans. Autom. Control., 2012
2011
Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation.
Oper. Res., 2011
Oper. Res., 2011
2010
Math. Oper. Res., 2010
Oper. Res., 2010
Oper. Res., 2010
2009
2007
2006
OR Spectr., 2006
2005
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times.
Oper. Res. Lett., 2005
Algorithmica, 2005
2004
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds.
SIAM J. Optim., 2004
2003
Oper. Res., 2003
2002
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures.
Manag. Sci., 2002
2001
Manag. Sci., 2001
J. Comput. Syst. Sci., 2001
An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT.
Ann. Oper. Res., 2001
2000
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.
SIAM J. Comput., 2000
Eur. J. Oper. Res., 2000
1999
1998
Math. Oper. Res., 1998
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems.
Oper. Res., 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
1997
Oper. Res. Lett., 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
1992
J. Graph Theory, 1992
1991
1990
J. Graph Theory, 1990