Xu Fengmin

Fengmin Xu

Information about the author Fengmin Xu will soon be added to the site.
Found 3 papers in total
A new Lagrangian net algorithm for solving max-bisection problems
2011
The max‐bisection problem is an NP ‐hard combinatorial optimization...
A continuation approach using NCP function for solving max-cut problem
2009
A continuous approach using NCP (nonlinear complementarity problem) function for...
Rank two relaxations to the quadratic knapsack problem
2004
The idea of rank two relaxation for max-cut problem is used for the quadratic knapsack...
Papers per page: