default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeng Fan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Zhiming Zhong
, Neng Fan, Lei Wu:
Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty. Eur. J. Oper. Res. 318(1): 179-199 (2024)- [j29]Zhiming Zhong, Neng Fan, Lei Wu:
Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems. J. Glob. Optim. 88(4): 999-1034 (2024) - [j28]Shunyu Yao, Neng Fan, Pavlo Krokhmal:
Minimizing the influence spread over a network through node interception. Optim. Lett. 18(6): 1361-1382 (2024) - [i4]Xianbang Chen, Yikui Liu, Zhiming Zhong, Neng Fan, Zhechong Zhao, Lei Wu:
A Carryover Storage Quantification Framework for Mid-Term Cascaded Hydropower Planning: A Portland General Electric System Study. CoRR abs/2409.09876 (2024) - 2023
- [j27]Zhiming Zhong, Neng Fan, Lei Wu:
A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market. Eur. J. Oper. Res. 306(2): 909-926 (2023) - [j26]Shunyu Yao, Neng Fan, Clark Seavert, Trent Teegerstrom:
Demand-Driven Harvest Planning and Machinery Scheduling for Guayule. Oper. Res. Forum 4(1): 1-25 (2023) - [j25]José Luis Ruiz Duarte, Neng Fan:
Operations of data centers with onsite renewables considering greenhouse gas emissions. Sustain. Comput. Informatics Syst. 40: 100903 (2023) - 2022
- [j24]Daniel A. Zuniga Vazquez, José Luis Ruiz Duarte, Neng Fan, Feng Qiu:
N-1-1 contingency-constrained unit commitment with renewable integration and corrective actions. Ann. Oper. Res. 316(1): 493-511 (2022) - [j23]Shunyu Yao, Neng Fan, Jie Hu:
Modeling the spread of infectious diseases through influence maximization. Optim. Lett. 16(5): 1563-1586 (2022) - [j22]Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer linear programming formulations for double roman domination problem. Optim. Methods Softw. 37(1): 1-22 (2022) - [c9]Zhihao Liao, Kai Xu, Neng Fan:
Swin Transformer Assisted Prior Attention Network for Medical Image Segmentation. ICCAI 2022: 491-497 - 2021
- [j21]Daniel A. Zuniga Vazquez, Ou Sun, Neng Fan, Evan Sproul, Hailey M. Summers, Jason C. Quinn, Sita Khanal, Paul Gutierrez, VeeAnder Mealing, Amy E. Landis, Clark Seavert, Trent Teegerstrom, Blase Evancho:
Integrating environmental and social impacts into optimal design of guayule and guar supply chains. Comput. Chem. Eng. 146: 107223 (2021) - [j20]Daniel A. Zuniga Vazquez, Neng Fan, Trent Teegerstrom, Clark Seavert, Hailey M. Summers, Evan Sproul, Jason C. Quinn:
Optimal production planning and machinery scheduling for semi-arid farms. Comput. Electron. Agric. 187: 106288 (2021) - [j19]Samira Karimi, Haitao Liao, Neng Fan:
Flexible methods for reliability estimation using aggregate failure-time data. IISE Trans. 53(1): 101-115 (2021) - [j18]Ran Gu, Yongtang Shi, Neng Fan:
Mixed connectivity properties of random graphs and some special graphs. J. Comb. Optim. 42(3): 427-441 (2021) - 2020
- [j17]José Luis Ruiz Duarte, Neng Fan, Tongdan Jin:
Multi-process production scheduling with variable renewable integration and demand response. Eur. J. Oper. Res. 281(1): 186-200 (2020) - [j16]Ya-Feng Liu, Fengmin Xu, Neng Fan, Jiming Peng:
Preface: special issue of MOA 2018. J. Glob. Optim. 76(4): 661-663 (2020) - [j15]Shanshan Hou, André Garrido, Neng Fan:
Vulnerability analysis of interdependent network via integer programming approaches. Optim. Lett. 14(7): 1921-1942 (2020) - [c8]Daniel A. Zuniga Vazquez, José Luis Ruiz Duarte, Neng Fan, Feng Qiu, Jianhui Wang:
Reliable Power Grid Expansion Considering $N-1-1$ Contingencies. ISGT 2020: 1-5
2010 – 2019
- 2019
- [j14]Wanlu Gu, Neng Fan, Haitao Liao:
Evaluating readmission rates and discharge planning by analyzing the length-of-stay of patients. Ann. Oper. Res. 276(1-2): 89-108 (2019) - [j13]Ou Sun, Neng Fan:
Solving the multistage PMU placement problem by integer programming and equivalent network design model. J. Glob. Optim. 74(3): 477-493 (2019) - [j12]Ou Sun, Neng Fan:
The probabilistic and reliable connected power dominating set problems. Optim. Lett. 13(5): 1189-1206 (2019) - [i3]Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer Linear Programming Formulations for Double Roman Domination Problem. CoRR abs/1902.07863 (2019) - 2018
- [j11]Ximing Wang, Neng Fan, Panos M. Pardalos:
Robust chance-constrained support vector machines with second-order moment information. Ann. Oper. Res. 263(1-2): 45-68 (2018) - [c7]Yanjun Pan, Ming Li, Neng Fan, Yantian Hou:
On the Throughput Limit of Multi-Hop Wireless Networks with Reconfigurable Antennas. SECON 2018: 280-288 - 2017
- [j10]Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson:
Contingency-constrained unit commitment with post-contingency corrective recourse. Ann. Oper. Res. 249(1-2): 381-407 (2017) - [j9]Pengfei Zhang, Neng Fan:
Analysis of budget for interdiction on multicommodity network flows. J. Glob. Optim. 67(3): 495-525 (2017) - [j8]Ximing Wang, Neng Fan, Panos M. Pardalos:
Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines. Optim. Lett. 11(5): 1013-1024 (2017) - [c6]Ran Gu, Yongtang Shi, Neng Fan:
Mixed Connectivity of Random Graphs. COCOA (1) 2017: 133-140 - 2016
- [j7]Elham Sadeghi, Neng Fan:
On the minimum-cost λ-edge-connected k-subgraph problem. Comput. Manag. Sci. 13(4): 571-596 (2016) - [j6]Matthew F. Dabkowski, Neng Fan, Ronald L. Breiger:
Exploratory blockmodeling for one-mode, unsigned, deterministic networks using integer programming and structural equivalence. Soc. Networks 47: 93-106 (2016) - 2014
- [c5]Neng Fan, Mehdi Golari:
Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs. COCOA 2014: 613-622 - [c4]Neng Fan, Elham Sadeghi, Panos M. Pardalos:
Robust Support Vector Machines with Polyhedral Uncertainty of the Input Data. LION 2014: 291-305 - [i2]Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson:
Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse. CoRR abs/1404.2964 (2014) - 2012
- [j5]Neng Fan, Panos M. Pardalos:
Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. J. Comb. Optim. 23(2): 224-251 (2012) - [j4]Haijun Liu, Neng Fan, Panos M. Pardalos:
Generalized Lagrange Function and Generalized Weak Saddle Points for a Class of Multiobjective Fractional Optimal Control Problems. J. Optim. Theory Appl. 154(2): 370-381 (2012) - [j3]Neng Fan, Qipeng P. Zheng, Panos M. Pardalos:
Robust optimization of graph partitioning involving interval uncertainty. Theor. Comput. Sci. 447: 53-61 (2012) - [c3]Neng Fan, Jean-Paul Watson:
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming. COCOA 2012: 371-383 - [i1]Richard Li-Yang Chen, Amy Cohn, Neng Fan, Ali Pinar:
N-k-e Survivable Power System Design. CoRR abs/1201.1530 (2012) - 2011
- [j2]Neng Fan, Panos M. Pardalos:
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem. J. Comb. Optim. 22(4): 747-762 (2011) - [c2]Neng Fan, Qipeng P. Zheng, Panos M. Pardalos:
On the Two-Stage Stochastic Graph Partitioning Problem. COCOA 2011: 500-509 - 2010
- [j1]Neng Fan, Panos M. Pardalos:
Linear and quadratic programming approaches for the general graph partitioning problem. J. Glob. Optim. 48(1): 57-71 (2010) - [c1]Neng Fan, Panos M. Pardalos:
Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks. COCOA (1) 2010: 170-183
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-21 20:32 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:
