default search action
Janny Leung
Person information
- affiliation: Chinese University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Fotios Petropoulos
, Gilbert Laporte, Emel Aktas
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2023
- [j38]Yong-Hong Kuo
Public transport for smart cities: Recent innovations and future challenges. Eur. J. Oper. Res. 306(3): 1001-1026 (2023) - 2022
- [j37]Haijiao Li, Kuan Yang, Janny M. Y. Leung, Guoqing Zhang
Markdown pricing strategy under a dual-channel supply chain with strategic consumers. RAIRO Oper. Res. 56(4): 2945-2966 (2022) - 2020
- [j36]David S. W. Lai
A graph-based formulation for the shift rostering problem. Eur. J. Oper. Res. 284(1): 285-300 (2020) - [j35]Yong-Hong Kuo, Nicholas B. Chan, Janny M. Y. Leung
An Integrated Approach of Machine Learning and Systems Thinking for Waiting Time Prediction in an Emergency Department. Int. J. Medical Informatics 139: 104143 (2020)
2010 – 2019
- 2019
- [j34]Ernesto Del R. Santibanez-Gonzalez
Towards a circular economy production system: trends and challenges for operations management. Int. J. Prod. Res. 57(23): 7209-7218 (2019) - 2018
- [j33]Pablo Adasme
Improved solution strategies for dominating trees. Expert Syst. Appl. 100: 30-40 (2018) - 2017
- [c13]Pablo Adasme, Rafael Andrade, Janny Leung
On a Traveling Salesman based Bilevel Programming Problem. ICORES 2017: 329-336 - [c12]Pablo Adasme, Janny Leung
Progressive Hedging and Sample Average Approximation for the Two-stage Stochastic Traveling Salesman Problem. ICORES 2017: 440-446 - 2016
- [j32]Jianqiang Cheng, Janny Leung
New reformulations of distributionally robust shortest path problem. Comput. Oper. Res. 74: 196-204 (2016) - [j31]Pablo Adasme
Resource allocation in uplink wireless multi-cell OFDMA networks. Comput. Stand. Interfaces 44: 274-289 (2016) - [j30]Yong-Hong Kuo
On the mixed set covering, packing and partitioning polytope. Discret. Optim. 22: 162-182 (2016) - [j29]Pablo Adasme
Models for minimum cost dominating trees. Electron. Notes Discret. Math. 52: 101-107 (2016) - [j28]Jinqiang Cheng, Abdel Lisser, Janny Leung:
Stochastic nonlinear resource allocation problem. Electron. Notes Discret. Math. 52: 165-172 (2016) - [j27]Jianqiang Cheng, Janny Leung
Random-payoff two-person zero-sum game with joint chance constraints. Eur. J. Oper. Res. 252(1): 213-219 (2016) - [c11]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem. ICORES 2016: 163-169 - 2015
- [c10]Yong-Hong Kuo
Embracing Big Data for Simulation Modelling of Emergency Department Processes and Activities. BigData Congress 2015: 313-316 - [c9]Yong-Hong Kuo
A Real-Time Decision Support Tool for Disaster Response: A Mathematical Programming Approach. BigData Congress 2015: 639-642 - [c8]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks. ICORES 2015: 125-132 - [c7]Eddie Y. S. Chan, Janny M. Y. Leung:
Game Theoretic Models for Competition in Public Transit Services. ICORES 2015: 133-139 - 2014
- [c6]Chuan Xu, Abdel Lisser, Janny Leung, Marc Letournel:
The p-Median Problem with Concave Costs. ICORES 2014: 205-212 - 2013
- [c5]Takashi Irohara
From Preparedness to Recovery: A Tri-Level Programming Model for Disaster Relief Planning. ICCL 2013: 213-228 - 2012
- [j26]Stefanie Kosuch, Pierre Le Bodic
On a stochastic bilevel programming problem. Networks 59(1): 107-116 (2012) - [c4]Ricky Chan, Janny Leung:
Implicit Learning of L2 word stress rules. CogSci 2012 - [c3]Yong-Hong Kuo
Simulation with data scarcity: developing a simulation model of a hospital emergency department. WSC 2012: 87:1-87:12 - [c2]Yong-Hong Kuo, Janny M. Y. Leung, Colin A. Graham:
Simulation with data scarcity: developing a simulation model of a hospital emergency department. WSC 2012: 311:1 - [c1]Yong-Hong Kuo, Janny M. Y. Leung, Colin A. Graham:
Simulation with data scarcity: developing a simulation model of a hospital emergency department. WSC 2012: 381:1 - 2011
- [j25]Hong K. Lo
Advanced systems for public transport scheduling and network design. Public Transp. 3(1): 1 (2011) - 2010
- [j24]Sin C. Ho
Solving a manpower scheduling problem for airline catering using metaheuristics. Eur. J. Oper. Res. 202(3): 903-921 (2010) - [j23]Hong K. Lo
Editorial: advanced methods for public transport system management. Public Transp. 2(1-2): 1-3 (2010) - [j22]Hong K. Lo
Advanced public transport system scheduling and control. Public Transp. 2(3): 157-158 (2010)
2000 – 2009
- 2008
- [j21]Rachel C. W. Wong, Tony W. Y. Yuen, Kwok Wah Fung, Janny May-Yee Leung
Optimizing Timetable Synchronization for Rail Mass Transit. Transp. Sci. 42(1): 57-69 (2008) - 2007
- [j20]Janny Leung, Chris Tang, Stefan Voß:
Special Issue for the 17th Triennial Conference of IFORS, Hawaii, July 2005. Int. Trans. Oper. Res. 14(1): 1 (2007) - [j19]Janny Leung, Chris Tang, Stefan Voß:
Special Issue for the 17th Triennial Conference of IFORS, Hawaii, July, 2005. Int. Trans. Oper. Res. 14(3): 201 (2007) - [j18]Janny Leung, Chris Tang, Stefan Voß:
Editorial: Fourth Special Issue for the 17th IFORS Triennial Conference. Int. Trans. Oper. Res. 14(5): 371 (2007) - [j17]Stefan Voß, Janny Leung, Chris Tang:
Fifth Special Issue for the 17th IFORS Triennial Conference. Int. Trans. Oper. Res. 14(6): 455 (2007) - 2006
- [j16]Janny Leung, Chris Tang, Stefan Voß:
Special Issues for the 17th Triennial Conference of IFORS, Hawaii, July, 2005. Int. Trans. Oper. Res. 13(3): 175 (2006) - [j15]Janny May-Yee Leung
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. Oper. Res. Lett. 34(4): 465-472 (2006) - 2005
- [j14]Chuda B. Basnet
Inventory lot-sizing with supplier selection. Comput. Oper. Res. 32: 1-14 (2005) - [j13]Jon Lee
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. J. Comb. Optim. 9(1): 59-67 (2005) - 2004
- [j12]Jon Lee
Min-up/min-down polytopes. Discret. Optim. 1(1): 77-85 (2004) - [j11]Janny May-Yee Leung
Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach. Oper. Res. 52(6): 965-976 (2004) - 2003
- [j10]Janny Leung
Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence. IEEE Trans. Robotics Autom. 19(3): 480-484 (2003) - 2002
- [j9]Xiande Zhao
The impact of forecasting model selection on the value of information sharing in a supply chain. Eur. J. Oper. Res. 142(2): 321-344 (2002)
1990 – 1999
- 1998
- [j8]Jill Hardin, Jon Lee, Janny Leung:
On the boolean-quadric packinguncapacitated facility-location polytope. Ann. Oper. Res. 83: 77-94 (1998) - 1996
- [j7]Karen I. Aardal, Martine Labbé
On the Two-Level Uncapacitated Facility Location Problem. INFORMS J. Comput. 8(3): 289-301 (1996) - 1994
- [j6]Janny Leung
More facets from fences for linear ordering and acyclic subgraph polytopes. Discret. Appl. Math. 50(2): 185-200 (1994) - [j5]Robert A. Russell, Janny M. Y. Leung
Devising a Cost Effective Schedule for a Baseball League. Oper. Res. 42(4): 614-625 (1994) - 1993
- [j4]Jon Lee
A comparison of two edge-coloring formulations. Oper. Res. Lett. 13(4): 215-223 (1993) - 1990
- [j3]Janny M. Y. Leung
Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics. Transp. Sci. 24(4): 245-260 (1990)
1980 – 1989
- 1989
- [j2]Janny M. Y. Leung
Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44(1-3): 271-291 (1989) - [j1]Janny M. Y. Leung
Facets and algorithms for capacitated lot sizing. Math. Program. 45(1-3): 331-359 (1989)
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-10-07 21:24 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: