Lin Geng

Geng Lin

Information about the author Geng Lin will soon be added to the site.
Found 4 papers in total
Max‐k‐Cut by the Discrete Dynamic Convexized Method
Max‐k‐Cut by the Discrete Dynamic Convexized Method
2013
In this paper, we propose a ‘multistart‐type’ algorithm for solving...
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
2011
The 0–1 linear knapsack problem with a single continuous variable ( KPC ) is an...
A dynamic convexized method for nonconvex mixed integer nonlinear programming
A dynamic convexized method for nonconvex mixed integer nonlinear programming
2011
We consider in this paper the nonconvex mixed‐integer nonlinear programming...
Routing algorithms for switching networks with probabilistic traffic
Routing algorithms for switching networks with probabilistic traffic
1996
Switching networks with probabilistic traffic are positioned prominently in...
Papers per page: