"In these years, local-search based heuristic algorithms, now called metaheuristics, became popular, although they do not have solid theoretical basis. These algorithms include genetic algorithms, simulated annealing, tabu search and so forth. As it is very complicated and time consuming to develop good metaheuristic algorithms, we were inclined to target those problems as general as possible, so that our products can be used by many people to solve their problems."
Quote Details
Added by wikiquote-import-bot
Unverified quote
0 likes
Original Language: English
Available Languages (1)
Sources
Imported from EN Wikiquote
https://en.wikiquote.org/wiki/Junichi_Iijima
Revision History
No revisions have been submitted for this quote.
Categories
Junichi Iijima
10 quotes on TrueQuotesView all quotes by Junichi Iijima →
Related Quotes
"My interest was then shifted to algorithmic aspects of combinatorial optimization, in particular dynamic programming …"
"In this period, R. Karp wrote a fascinating paper that formulated dynamic programming as a finite automaton with a mo…"
"I also made similar study on branch and bound algorithms in a general framework. My results in this area are summariz…"
"In the middle seventies, S. Cook and R. Karp came up with a notion of NP-completeness, creating a new field of comput…"
"I spent most of the time in the eighties developing algorithms for integer programming, fractional programming, sched…"
"In this area, H. Nagamochi is a powerful partner and, with him, we recently published Algorithmic Aspects of Graph Co…"
"From the nineties to the first decade of the new century, my research interest has been gradually shifted to the appl…"
"For this purpose we have chosen such standard problems as constraint satisfaction problem, resource constrained proje…"
"I am glad to see these outcomes. Jointly with M. Yagiura, we wrote a textbook Combinatorial Optimization - Metaheuris…"
"Based on the sales variations and product diversification, our company is the number one in Japan. Even though we pro…"