Abstract |
: |
Discrete/combinatorial optimization has been an interesting and challenging area to researchers belonging to development of
algorithms and OR techniques for real-world applications. Most such problems abstracted/taken from graph theory are NP-complete in
single objective, and NP-hard for multiple objectives. There are many applications of such problems in communication topology and
VLSI design.
For most such problems, there do not exist good heuristics/algorithms, therefore, black-box optimization techniques, e.g., EAs are
emerging/preferred for getting effective solutions. In this talk, we will do a quick review of some of the standard combinatorial
optimization problems, and then include the techniques and design of operators to effectively solve EMCO problems taken from
real-world applications. This would be followed by some case-studies taken from standard problems.
http://www.facweb.iitkgp.ernet.in/~rkumar |
|