default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNingxiong Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j11]Nathanael J. K. Brown, Bryan Arguello, Linda K. Nozick
, Ningxiong Xu:
A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation. IEEE Syst. J. 12(4): 3828-3836 (2018)- 2017
- [j10]Ningxiong Xu:
Optimal inventory policy for a dynamic stochastic inventory problem with order revision. Optim. Lett. 11(7): 1489-1497 (2017) - 2015
- [c5]Nathanael J. K. Brown, Katherine A. Jones, Linda K. Nozick, Ningxiong Xu:
Multi-layered security investment optimization using a simulation embedded within a genetic algorithm. WSC 2015: 2424-2435 - 2013
- [j9]Ningxiong Xu, Arthur F. Veinott Jr.:
Sequential stochastic core of a cooperative stochastic programming game. Oper. Res. Lett. 41(5): 430-435 (2013) - [c4]Nathanael J. K. Brown, Jared L. Gearhart, Dean A. Jones, Linda K. Nozick, Natalia Romero, Ningxiong Xu:
Multi-objective optimization for bridge retrofit to address earthquake hazards. WSC 2013: 2475-2486 - 2011
- [c3]Nathanael J. K. Brown, Jared L. Gearhart, Dean A. Jones, Linda K. Nozick, Natalia Romero, Ningxiong Xu:
Optimization of scenario construction for loss estimation in lifeline networks. WSC 2011: 1739-1750
2000 – 2009
- 2009
- [j8]Ningxiong Xu, Linda K. Nozick:
Modeling supplier selection and the use of option contracts for global supply chain design. Comput. Oper. Res. 36(10): 2786-2800 (2009) - [j7]Ningxiong Xu:
Optimal policy for a two-facility inventory problem with storage constraints and two freight modes. Eur. J. Oper. Res. 194(1): 78-84 (2009) - [j6]Ningxiong Xu:
Optimal policy for a dynamic, non-stationary, stochastic inventory problem with capacity commitment. Eur. J. Oper. Res. 199(2): 400-408 (2009) - 2008
- [j5]Ningxiong Xu, Sally A. McKee, Linda K. Nozick, Ruke Ufomata:
Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem. Comput. Oper. Res. 35(10): 3284-3297 (2008) - 2007
- [j4]Atsuhiro Dodo, Rachel A. Davidson, Ningxiong Xu, Linda K. Nozick:
Application of regional earthquake mitigation optimization. Comput. Oper. Res. 34(8): 2478-2494 (2007) - [c2]Ningxiong Xu, Linda K. Nozick, Mark A. Turnquist, Dean A. Jones:
Optimizing Investment for Recovery in Interdependent Infrastructure. HICSS 2007: 112 - [c1]Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean A. Jones:
Stochastic rollout and justification to solve the resource-constrained project scheduling problem. WSC 2007: 1820-1827 - 2006
- [j3]Ningxiong Xu:
Flexible supply policy with options and capacity constraints. Oper. Res. Lett. 34(5): 508-516 (2006) - 2005
- [j2]Ningxiong Xu:
Multi-period dynamic supply contracts with cancellation. Comput. Oper. Res. 32: 3129-3142 (2005) - 2004
- [j1]Linda K. Nozick, Mark A. Turnquist, Ningxiong Xu:
Managing Portfolios of Projects under Uncertainty. Ann. Oper. Res. 132(1-4): 243-256 (2004)
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:56 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:
