A deterministic annealing algorithm for approximating a solution of the max-bisection problem
スポンサーリンク
概要
- 論文の詳細を見る
- 2002-04-01
著者
-
DANG Chuangyin
Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong
-
HE Liping
Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong
-
HUI Ip
Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong
-
Hui Ip
Department Of Manufacturing Engineering And Engineering Management City University Of Hong Kong
-
He Liping
Department Of Manufacturing Engineering And Engineering Management City University Of Hong Kong
関連論文
- A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem
- Neural networks for nonlinear and mixed complementarity problems and their applications
- Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm
- A deterministic annealing algorithm for approximating a solution of the max-bisection problem