The life span method - A new variant of local search

Mikio Kubo, Katsuki Fujisawa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


In this paper, we present a variant of local search, namely the Life Span Method (LSM), for generic combinatorial optimization problems. The LSM can be seen as a variation of tabu search introduced by Glover [18, 19]. We outline applications of the LSM to several combinatorial optimization problems such as the maximum stable set problem, the traveling salesman problem, the quadratic assignment problem, the graph partitioning problem, the graph coloring problem, and the job-shop scheduling problem.

Original languageEnglish
Pages (from-to)363-393
Number of pages31
JournalJapan Journal of Industrial and Applied Mathematics
Issue number3
Publication statusPublished - Oct 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Applied Mathematics


Dive into the research topics of 'The life span method - A new variant of local search'. Together they form a unique fingerprint.

Cite this