Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm

スポンサーリンク

概要

• 論文の詳細を見る
• 2000-09-01

著者

• DANG Chuangyin

  Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong

• Dang C

  City Univ. Hong Kong Hong Kong Chn

関連論文

• 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

スポンサーリンク