default search action
Gang Yu 0001
Person information
- affiliation: University of Texas at Austin, Department of Management Science and Information Systems, TX, USA
Other persons with the same name
- Gang Yu — disambiguation page
- Gang Yu 0002
— StepFun (and 4 more)
- Gang Yu 0003
- Gang Yu 0004
- Gang Yu 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j41]Gang Li, Gang Yu, Shouyang Wang
Bullwhip and anti-bullwhip effects in a supply chain. Int. J. Prod. Res. 55(18): 5423-5434 (2017)
2000 – 2009
- 2009
- [j40]Lei Yang, Minghui Xu, Gang Yu, Hanqin Zhang:
Supply Chain Coordination with CVaR Criterion. Asia Pac. J. Oper. Res. 26(1): 135-160 (2009) - [r2]Gang Yu, Benjamin G. Thengvall
Airline Optimization. Encyclopedia of Optimization 2009: 26-30 - 2008
- [j39]Chung-Yee Lee, Gang Yu:
Parallel-machine scheduling under potential disruption. Optim. Lett. 2(1): 27-37 (2008) - 2007
- [j38]Chung-Yee Lee, Gang Yu:
Single machine scheduling under potential disruption. Oper. Res. Lett. 35(4): 541-548 (2007) - [j37]Guidong Zhu, Jonathan F. Bard, Gang Yu:
A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Sched. 10(3): 167-180 (2007) - 2006
- [j36]Tiaojun Xiao, Gang Yu:
Supply chain disruption management and evolutionarily stable strategies of retailers in the quantity-setting duopoly situation with homogeneous goods. Eur. J. Oper. Res. 173(2): 648-668 (2006) - [j35]Jian Yang, Xiangtong Qi
Inventory control with Markovian capacity and the option of order rejection. Eur. J. Oper. Res. 174(1): 622-645 (2006) - [j34]Guidong Zhu, Jonathan F. Bard, Gang Yu:
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS J. Comput. 18(3): 377-390 (2006) - [j33]Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu:
Two Machine Scheduling under Disruptions with Transportation Considerations. J. Sched. 9(1): 35-48 (2006) - 2005
- [j32]Shouyang Wang, Gang Yu, Hanqin Zhang:
Preface. Ann. Oper. Res. 135(1): 17-18 (2005) - [j31]Shouyang Wang, Gang Yu, Hanqin Zhang:
Acknowledgments. Ann. Oper. Res. 135(1): 19 (2005) - [j30]Tiaojun Xiao, Gang Yu, Zhaohan Sheng, Yusen Xia:
Coordination of a Supply Chain with One-Manufacturer and Two-Retailers Under Demand Promotion and Disruption Management Decisions. Ann. Oper. Res. 135(1): 87-109 (2005) - [j29]Gang Li, Shouyang Wang
Information transformation in a supply chain: a simulation study. Comput. Oper. Res. 32: 707-725 (2005) - 2004
- [j28]Tiaojun Xiao, Gang Yu, Zhao-Han Sheng:
Reputation, Utility And Technological Innovation Strategies. Int. J. Inf. Technol. Decis. Mak. 3(1): 81-100 (2004) - [j27]Gang Yu, Julian Pachon, Benjamin G. Thengvall
Optimizing Pilot Planning and Training for Continental Airlines. Interfaces 34(4): 253-264 (2004) - [j26]Xiangtong Qi
Class Scheduling for Pilot Training. Oper. Res. 52(1): 148-162 (2004) - [r1]Xiangtong Qi, Jian Yang, Gang Yu:
Scheduling Problems in the Airline Industry. Handbook of Scheduling 2004 - 2003
- [j25]Gang Yu, Michael F. Argüello, Gao Song, Sandra M. McCowan, Anna White:
Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: A New Era for Crew Recovery at Continental Airlines. Interfaces 33(1): 5-22 (2003) - [j24]Benjamin G. Thengvall
A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures. Transp. Sci. 37(4): 392-407 (2003) - 2002
- [j23]Xiangtong Qi, Gang Yu, Jonathan F. Bard:
Single machine scheduling with assignable due dates. Discret. Appl. Math. 122(1-3): 211-233 (2002) - [j22]Guojun Li, Chuanping Chen, Gang Yu:
Orthogonal factorizations of graphs. Discret. Math. 245(1-3): 173-194 (2002) - [j21]Gang Yu, Zhao-Han Sheng, Tiaojun Xiao:
An Effective Algorithm for Computing Equilibrium Outcome of a Class of Signaling Games. Int. J. Inf. Technol. Decis. Mak. 1(2): 209-228 (2002) - [j20]Jian Yang, Gang Yu:
On the Robust Single Machine Scheduling Problem. J. Comb. Optim. 6(1): 17-33 (2002) - [j19]Jonathan F. Bard, George Kontoravdis, Gang Yu:
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transp. Sci. 36(2): 250-269 (2002) - 2001
- [j18]William W. Cooper, Kyung Sam Park, Gang Yu:
An Illustrative Application of Idea (Imprecise Data Envelopment Analysis) to a Korean Mobile Telecommunication Company. Oper. Res. 49(6): 807-820 (2001) - [j17]Selçuk Karabati
A Min-Max-Sum Resource Allocation Problem and Its Applications. Oper. Res. 49(6): 913-922 (2001) - [j16]William W. Cooper, Kyung Sam Park, Gang Yu:
IDEA (Imprecise Data Envelopment Analysis) with CMDs (Column Maximum Decision Making Units). J. Oper. Res. Soc. 52(2): 176-181 (2001)
1990 – 1999
- 1997
- [j15]David Nehme, Gang Yu:
The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications. Discret. Appl. Math. 74(1): 57-68 (1997) - [j14]Gang Yu:
Robust economic order quantity models. Eur. J. Oper. Res. 100(3): 482-493 (1997) - [j13]Gang Yu, Olivier Goldschmidt:
Local Optimality and Its Application on Independent Sets for k-claw Free Graphs. J. Comb. Optim. 1(2): 151-164 (1997) - [j12]Michael F. Argüello, Jonathan F. Bard, Gang Yu:
A Grasp for Aircraft Routing in Response to Groundings and Delays. J. Comb. Optim. 1(3): 211-228 (1997) - [j11]Guo Wei, Gang Yu, Mark Song:
Optimization Model and Algorithm for Crew Management During Airline Irregular Operations. J. Comb. Optim. 1(3): 305-321 (1997) - [j10]Songjun Luo, Gang Yu:
On the Airline Schedule Perturbation Problem Caused by the Ground Delay Program. Transp. Sci. 31(4): 298-311 (1997) - 1996
- [j9]Gang Yu, Quanling Wei, Patrick L. Brockett:
A generalized data envelopment analysis model: A unification and extension of existing methods for efficiency analysis of decision making units. Ann. Oper. Res. 66(1): 47-89 (1996) - [j8]Ho Geun Lee, Ronald M. Lee, Gang Yu:
Constraint logic programming for qualitative and quantitative constraint satisfaction problems. Decis. Support Syst. 16(1): 67-83 (1996) - [j7]Gang Yu:
On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications. Oper. Res. 44(2): 407-415 (1996) - [j6]Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discret. Math. 9(3): 492-509 (1996) - 1995
- [j5]Leon S. Lasdon, John C. Plummer, Gang Yu:
Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs. INFORMS J. Comput. 7(3): 321-332 (1995) - 1994
- [j4]Panagiotis Kouvelis, Gang Yu, Songjun Luo:
Vertex packing problem application to the design of electronic testing fixtures. Ann. Oper. Res. 50(1): 319-337 (1994) - 1993
- [j3]Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu:
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. Inf. Process. Lett. 48(6): 305-310 (1993) - [j2]Kavindra Malik, Gang Yu:
A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks 23(6): 525-532 (1993) - [j1]Ahmad I. Z. Jarrah, Gang Yu, Nirup Krishnamurthy, Ananda Rakshit:
A Decision Support Framework for Airline Flight Cancellations and Delays. Transp. Sci. 27(3): 266-280 (1993)
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-18 19:21 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: