Chung-Piaw Teo

  • National University of Singapore

According to our database1, Chung-Piaw Teo authored at least 68 papers between 1990 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Cross-Border E-Commerce Data Set: Choosing the Right Fulfillment Option.
Manuf. Serv. Oper. Manag., 2021

On Policies for Single-Leg Revenue Management with Limited Demand Information.
Oper. Res., 2021

Limousine Service Management: Capacity Planning with Predictive Analytics and Optimization.
INFORMS J. Appl. Anal., 2021

Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice Restriction.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Smart City Operations: Modeling Challenges and Opportunities.
Manuf. Serv. Oper. Manag., 2020

Appointment Scheduling Under Time-Dependent Patient No-Show Behavior.
Manag. Sci., 2020

Judgment Error in Lottery Play: When the Hot Hand Meets the Gambler's Fallacy.
Manag. Sci., 2020

Regularised Text Logistic Regression: Key Word Detection and Sentiment Classification for Online Reviews.
CoRR, 2020

Convex Optimization for Bundle Size Pricing Problem.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Capacity Allocation in Flexible Production Networks: Theory and Applications.
Manag. Sci., 2019

Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited.
Oper. Res., 2019

Material and Cash Flow in Two-Tier Supply Chain with Trade Credits and Defaults.
Found. Trends Technol. Inf. Oper. Manag., 2019

Resource Pooling and Allocation Policies to Deliver Differentiated Service.
Manag. Sci., 2018

On the Design of Sparse but Efficient Structures in Operations.
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

On reduced semidefinite programs for second order moment bounds with applications.
Math. Program., 2017

Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty.
Oper. Res., 2016

Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal.
Eur. J. Oper. Res., 2016

On Theoretical and Empirical Aspects of Marginal Distribution Choice Models.
Manag. Sci., 2014

Distributionally robust mixed integer linear programs: Persistency models with applications.
Eur. J. Oper. Res., 2014

Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems.
Oper. Res., 2013

Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones.
Oper. Res., 2013

Choice Prediction With Semidefinite Optimization When Utilities are Correlated.
IEEE Trans. Autom. Control., 2012

Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation.
Oper. Res., 2011

Process Flexibility Revisited: The Graph Expander and Its Applications.
Oper. Res., 2011

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion.
Math. Oper. Res., 2010

Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure.
Oper. Res., 2010

From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization.
Oper. Res., 2010

On range and response: Dimensions of process flexibility.
Eur. J. Oper. Res., 2010

Persistency Model and Its Applications in Choice Modeling.
Manag. Sci., 2009

The stochastic location model with risk pooling.
Eur. J. Oper. Res., 2007

Designing two-echelon supply networks.
Eur. J. Oper. Res., 2007

Berth management in container terminal: the template design problem.
OR Spectr., 2006

Inventory placement in acyclic supply chain networks.
Oper. Res. Lett., 2006

Persistence in discrete optimization under data uncertainty.
Math. Program., 2006

Many-to-One Stable Matching: Geometry and Fairness.
Math. Oper. Res., 2006

Anonymous monotonic social welfare functions.
J. Econ. Theory, 2006

Asymptotically optimal schedules for single-server flow shop problems with setup costs and times.
Oper. Res. Lett., 2005

Stochastic Transportation-Inventory Network Design Problem.
Oper. Res., 2005

Staggering Periodic Replenishment in Multivendor JIT Environments.
Oper. Res., 2005

Effective Routing and Scheduling in Adversarial Queueing Networks.
Algorithmica, 2005

Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds.
SIAM J. Optim., 2004

Warehouse-Retailer Network Design Problem.
Oper. Res., 2004

Integer Programming and Arrovian Social Welfare Functions.
Math. Oper. Res., 2003

Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems.
Oper. Res., 2003

Managing Risk in a Four-Digit Number Game.
SIAM Rev., 2002

Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures.
Manag. Sci., 2002

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.
Manag. Sci., 2001

A Polynomial-time Algorithm for the Bistable Roommates Problem.
J. Comput. Syst. Sci., 2001

Multistage Lot Sizing Problems via Randomized Rounding.
Oper. Res., 2001

An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT.
Ann. Oper. Res., 2001

A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.
SIAM J. Comput., 2000

On a cutting plane heuristic for the stable roommates problem and its applications.
Eur. J. Oper. Res., 2000

On dependent randomized rounding algorithms.
Oper. Res. Lett., 1999

Analysis of LP relaxations for multiway and multicut problems.
Networks, 1999

The Geometry of Fractional Stable Matchings and Its Applications.
Math. Oper. Res., 1998

From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems.
Oper. Res., 1998

Multi-Item Inventory Staggering Problems: Heuristic and Bounds.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

The parsimonious property of cut covering problems and its applications.
Oper. Res. Lett., 1997

LP Based Approach to Optimal Stable Matchings.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Chromaticity of series-parallel graphs.
Discret. Math., 1996

Improved Randomized Approximation Algorithms for Lot-Sizing Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

On chromatic uniqueness of uniform subdivisions of graphs.
Discret. Math., 1994

The number of shortest cycles and the chromatic uniqueness of a graph.
J. Graph Theory, 1992

The chromatic uniqueness of certain broken wheels.
Discret. Math., 1991

The chromaticity of complete bipartite graphs with at most one edge deleted.
J. Graph Theory, 1990