Taboo search: an approach to the multiple minima problem

被引：0
|
作者：
机构：
来源：
Science | / 5198卷 / 664期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] The Search Successive Minima Problem Is Equivalent to Its Optimization Version
    Li, Haoyu
    Pan, Yanbin
    INFORMATION SECURITY APPLICATIONS, 2018, 10763 : 39 - 50
  • [22] APPROACHES TO THE MULTIPLE-MINIMA PROBLEM IN PROTEIN FOLDING
    SCHERAGA, HA
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1989, 197 : 111 - PHYS
  • [23] Surmounting the multiple-minima problem in protein folding
    Scheraga, HA
    Lee, J
    Pillardy, J
    Ye, YJ
    Liwo, A
    Ripoll, D
    JOURNAL OF GLOBAL OPTIMIZATION, 1999, 15 (03) : 235 - 260
  • [24] HELIX FOLDING SIMULATIONS AND THE MULTIPLE-MINIMA PROBLEM
    SUNG, SS
    BIOPHYSICAL JOURNAL, 1994, 66 (02) : A15 - A15
  • [25] Surmounting the Multiple-Minima Problem in Protein Folding
    Harold A. Scheraga
    Jooyoung Lee
    Jarosław Pillardy
    Yuan-Jie Ye
    Adam Liwo
    Daniel Ripoll
    Journal of Global Optimization, 1999, 15 : 235 - 260
  • [26] Geometric approach and taboo search for scheduling flexible manufacturing systems
    Mati, Y
    Rezg, N
    Xie, XL
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (06): : 805 - 818
  • [27] Search for common minima in joint optimization of multiple cost functions
    Adachi, Daiki
    Tsujimoto, Naoto
    Akashi, Ryosuke
    Todo, Synge
    Tsuneyuki, Shinji
    COMPUTER PHYSICS COMMUNICATIONS, 2019, 241 : 92 - 97
  • [28] Long-distance potentials: an approach to the multiple-minima problem in ligand-receptor interaction
    Protein Eng, 1 (37):
  • [29] Long-distance potentials: An approach to the multiple-minima problem in ligand-receptor interaction
    Vakser, IA
    PROTEIN ENGINEERING, 1996, 9 (01): : 37 - 41
  • [30] A multiple-level variable neighborhood search approach to the orienteering problem
    Liang, Yun-Chia
    Kulturel-Konak, Sadan
    Lo, Min-Hua
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2013, 30 (04) : 238 - 247
12345