Our research aims at the development of efficient computational
for problems in the areas of combinatorial optimization, integer
and combinatorial structures, their theory and applications.
Combinatorial optimization and integer programming deals with many practically important optimization problems which are combinatorial in nature. Some examples of such problems include the design of reliable communication networks, fast printed circuit board production, scheduling problems and routing problems.
The study of combinatorial structures includes the arrangement of discrete objects in a very balanced or tightly restricted way. Combinatorial structures like graphs and combinatorial designs model several problems arising in information technology, including problems in communications and security, software testing and bioinformatics.
Our research focuses towards the following aspects of integer programming, combinatorial optimization and combinatorial structures: