Neng Fan

According to our database1, Neng Fan authored at least 27 papers between 2010 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Vulnerability analysis of interdependent network via integer programming approaches.
Optim. Lett., 2020

Preface: special issue of MOA 2018.
J. Glob. Optim., 2020

Multi-process production scheduling with variable renewable integration and demand response.
Eur. J. Oper. Res., 2020

Reliable Power Grid Expansion Considering $N-1-1$ Contingencies.
Proceedings of the IEEE Power & Energy Society Innovative Smart Grid Technologies Conference, 2020

The probabilistic and reliable connected power dominating set problems.
Optim. Lett., 2019

Solving the multistage PMU placement problem by integer programming and equivalent network design model.
J. Glob. Optim., 2019

Integer Linear Programming Formulations for Double Roman Domination Problem.
CoRR, 2019

Evaluating readmission rates and discharge planning by analyzing the length-of-stay of patients.
Ann. Oper. Res., 2019

Robust chance-constrained support vector machines with second-order moment information.
Ann. Oper. Res., 2018

On the Throughput Limit of Multi-Hop Wireless Networks with Reconfigurable Antennas.
Proceedings of the 15th Annual IEEE International Conference on Sensing, 2018

Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines.
Optim. Lett., 2017

Analysis of budget for interdiction on multicommodity network flows.
J. Glob. Optim., 2017

Contingency-constrained unit commitment with post-contingency corrective recourse.
Ann. Oper. Res., 2017

Mixed Connectivity of Random Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

Exploratory blockmodeling for one-mode, unsigned, deterministic networks using integer programming and structural equivalence.
Soc. Networks, 2016

On the minimum-cost λ-edge-connected <i>k</i>-subgraph problem.
Comput. Manag. Sci., 2016

Robust Support Vector Machines with Polyhedral Uncertainty of the Input Data.
Proceedings of the Learning and Intelligent Optimization, 2014

Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2014

Robust optimization of graph partitioning involving interval uncertainty.
Theor. Comput. Sci., 2012

Generalized Lagrange Function and Generalized Weak Saddle Points for a Class of Multiobjective Fractional Optimal Control Problems.
J. Optim. Theory Appl., 2012

Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs.
J. Comb. Optim., 2012

N-k-e Survivable Power System Design
CoRR, 2012

Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming.
Proceedings of the Combinatorial Optimization and Applications, 2012

A rearrangement of adjacency matrix based approach for solving the crossing minimization problem.
J. Comb. Optim., 2011

On the Two-Stage Stochastic Graph Partitioning Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

Linear and quadratic programming approaches for the general graph partitioning problem.
J. Glob. Optim., 2010

Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks.
Proceedings of the Combinatorial Optimization and Applications, 2010