![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Houyuan Jiang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j26]Lidia Betcheva
, Feryal Erhun
, Houyuan Jiang
:
OM Forum - Supply Chain Thinking in Healthcare: Lessons and Outlooks. Manuf. Serv. Oper. Manag. 23(6): 1333-1353 (2021) - [j25]Yue Tang
, Houyuan Jiang, Jingui Xie
, Zhichao Zheng
:
A queueing model for customer rescheduling and no-shows in service systems. Oper. Res. Lett. 49(6): 821-828 (2021)
2010 – 2019
- 2019
- [j24]Yun-Bin Zhao
, Houyuan Jiang
, Zhi-Quan Luo:
Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction. Math. Oper. Res. 44(1): 173-195 (2019) - 2017
- [i1]Yun-Bin Zhao, Houyuan Jiang, Zhi-Quan Luo:
Weak Stability of ࡁ1-minimization Methods in Sparse Data Reconstruction. CoRR abs/1710.10883 (2017) - 2016
- [j23]Giovanni Giallombardo
, Houyuan Jiang, Giovanna Miglionico:
New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials. Oper. Res. 64(4): 838-848 (2016) - 2014
- [j22]Edward Hult, Houyuan Jiang, Daniel Ralph:
Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem. Comput. Optim. Appl. 59(1-2): 185-200 (2014) - 2012
- [j21]Houyuan Jiang, Zhan Pang, Sergei V. Savin
:
Performance-Based Contracts for Outpatient Medical Services. Manuf. Serv. Oper. Manag. 14(4): 654-669 (2012) - 2011
- [j20]Houyuan Jiang, Zhan Pang:
Network capacity management under competition. Comput. Optim. Appl. 50(2): 287-326 (2011) - [j19]Houyuan Jiang, Serguei Netessine
, Sergei V. Savin
:
TECHNICAL NOTE - Robust Newsvendor Competition Under Asymmetric Information. Oper. Res. 59(1): 254-261 (2011)
2000 – 2009
- 2009
- [j18]Andreas T. Ernst
, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy
, Gerhard J. Woeginger:
Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7): 2230-2241 (2009) - 2008
- [j17]Houyuan Jiang, Huifu Xu
:
Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem. IEEE Trans. Autom. Control. 53(6): 1462-1475 (2008) - 2006
- [j16]Andreas T. Ernst
, Houyuan Jiang, Mohan Krishnamoorthy
:
Exact Solutions to Task Allocation Problems. Manag. Sci. 52(10): 1634-1646 (2006) - 2005
- [j15]Kevin Gale, Houyuan Jiang, Mark Westcott:
An Optimization Method for the Identification of Minimal Sets of Discriminating Gene Markers: Application to Cultivar Identification in Wheat. J. Bioinform. Comput. Biol. 3(2): 269-280 (2005) - 2004
- [j14]Houyuan Jiang, Mohan Krishnamoorthy
, David Sier:
Preface. Ann. Oper. Res. 127(1-4): 17-20 (2004) - [j13]Andreas T. Ernst, Houyuan Jiang, Mohan Krishnamoorthy
, Bowie Owens, David Sier:
An Annotated Bibliography of Personnel Scheduling and Rostering. Ann. Oper. Res. 127(1-4): 21-144 (2004) - [j12]Houyuan Jiang, Mohan Krishnamoorthy
, David Sier:
Preface. Ann. Oper. Res. 128(1-4): 17-20 (2004) - [j11]Andreas T. Ernst
, Houyuan Jiang, Mohan Krishnamoorthy
, David Sier:
Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1): 3-27 (2004) - 2003
- [j10]Houyuan Jiang, Daniel Ralph:
Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints. Comput. Optim. Appl. 25(1-3): 123-150 (2003) - 2001
- [j9]Andreas T. Ernst
, Houyuan Jiang, Mohan Krishnamoorthy
, H. Nott, David Sier:
An Integrated Optimization Model for Train Crew Management. Ann. Oper. Res. 108(1-4): 211-224 (2001) - 2000
- [j8]Andreas Fischer
, Houyuan Jiang:
Merit Functions for Complementarity and Related Problems: A Survey. Comput. Optim. Appl. 17(2-3): 159-182 (2000) - [j7]Houyuan Jiang, Daniel Ralph:
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints. SIAM J. Optim. 10(3): 779-808 (2000)
1990 – 1999
- 1999
- [j6]Houyuan Jiang, Daniel Ralph:
QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints. Comput. Optim. Appl. 13(1-3): 25-59 (1999) - [j5]Francisco Facchinei
, Houyuan Jiang, Liqun Qi
:
A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85(1): 107-134 (1999) - 1998
- [j4]Christian Kanzow, Houyuan Jiang:
A continuation method for (strongly) monotone variational inequalities. Math. Program. 81: 103-125 (1998) - [j3]Houyuan Jiang, Masao Fukushima, Liqun Qi, Defeng Sun
:
A Trust Region Method for Solving Generalized Complementarity Problems. SIAM J. Optim. 8(1): 140-157 (1998) - 1997
- [j2]Liqun Qi, Houyuan Jiang:
Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations. Math. Oper. Res. 22(2): 301-325 (1997) - 1996
- [j1]Houyuan Jiang:
Unconstrained minimization approaches to nonlinear complementarity problems. J. Glob. Optim. 9(2): 169-181 (1996)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint