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

Search this Article

Author(s)

    • DANG Chuangyin
    • Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong

Journal

  • Neural networks : the official journal of the International Neural Network Society

    Neural networks : the official journal of the International Neural Network Society 13(7), 801-810, 2000-09-01

References:  19

Codes

  • NII Article ID (NAID)
    10008963019
  • NII NACSIS-CAT ID (NCID)
    AA10680676
  • Text Lang
    ENG
  • Article Type
    ART
  • ISSN
    08936080
  • Data Source
    CJP 
Page Top