Studies on general purpose heuristic algorithms for combinatorial problems

[目次]

  • 論文目録
  • Contents
  • 1 Introduction / p1
  • 1.1 Historical background / p1
  • 1.2 General problem solver / p3
  • 1.3 Overview of the thesis / p5
  • 2 Constraint Satisfaction / p9
  • 2.1 Introduction / p9
  • 2.2 Formulations of CSP and WCSP / p9
  • 2.3 Basic techniques for solving CSP / p11
  • 2.4 Previous work on WCSP / p13
  • 3 A Tabu Search Algorithm for CSP / p15
  • 3.1 Introduction / p15
  • 3.2 Basic implementation of tabu search / p15
  • 3.3 Adaptive control of tabu tenure / p18
  • 3.4 Computational experiments / p20
  • 3.5 Conclusion / p27
  • 4 An Improved Tabu Search Algorithm for WCSP / p29
  • 4.1 Introduction / p29
  • 4.2 Improved tabu search algorithm / p30
  • 4.3 Computational experiments / p34
  • 4.4 Conclusion / p46
  • 5 Different CSP Formulations and Their Computational Results / p49
  • 5.1 Introduction / p49
  • 5.2 Computational experiments / p50
  • 5.3 Conclusion / p53
  • 6 A General Problem Solver Specialized to Scheduling Problems / p55
  • 6.1 Introduction / p55
  • 6.2 Formulation of RCPSP / p56
  • 6.3 Tabu search for RCPSP / p61
  • 6.4 Computational experiments / p75
  • 6.5 Conclusion / p82
  • 7 Conclusion / p85

「国立国会図書館デジタルコレクション」より

この本の情報

書名 Studies on general purpose heuristic algorithms for combinatorial problems
著作者等 野々部 宏司
書名別名 組合せ問題に対する汎用近似アルゴリズムに関する研究
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想