default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLap Mui Ann Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j10]Luca Bertazzi, Lap Mui Ann Chan:
Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times. J. Optim. Theory Appl. 163(1): 286-309 (2014)- 2010
- [j9]Mustafa Karakul, Lap Mui Ann Chan:
Joint pricing and procurement of substitutable products with random demands - A technical note. Eur. J. Oper. Res. 201(1): 324-328 (2010) - 2008
- [j8]Mustafa Karakul, Lap Mui Ann Chan:
Analytical and managerial implications of integrating product substitutability in the joint pricing and procurement problem. Eur. J. Oper. Res. 190(1): 179-204 (2008) - 2006
- [j7]Lap Mui Ann Chan, David Simchi-Levi, Julie L. Swann
:
Pricing, Production, and Inventory Policies for Manufacturing with Stochastic Demand and Discretionary Sales. Manuf. Serv. Oper. Manag. 8(2): 149-168 (2006) - 2005
- [j6]Stephan Biller, Lap Mui Ann Chan, David Simchi-Levi, Julie L. Swann:
Dynamic Pricing and the Direct-to-Customer Model in the Automotive Industry. Electron. Commer. Res. 5(2): 309-334 (2005) - 2002
- [j5]Lap Mui Ann Chan, Ana Muriel, Zuo-Jun Max Shen, David Simchi-Levi:
On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures. Oper. Res. 50(6): 1058-1067 (2002) - [j4]Lap Mui Ann Chan, Ana Muriel, Zuo-Jun Max Shen, David Simchi-Levi, Chung-Piaw Teo:
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures. Manag. Sci. 48(11): 1446-1460 (2002) - 1998
- [j3]Lap Mui Ann Chan, Awi Federgruen, David Simchi-Levi:
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models. Oper. Res. 46(1): 96-106 (1998) - [j2]Lap Mui Ann Chan, Ana Muriel, David Simchi-Levi:
Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics. Oper. Res. 46(5): 729-741 (1998) - [j1]Lap Mui Ann Chan, David Simchi-Levi, Julien Bramel:
Worst-case analyses, linear programming and the bin-packing problem. Math. Program. 83: 213-227 (1998)
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-04-24 22:58 CEST 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:
