The ECCO annual meetings aim to bring together researchers in the field of Combinatorial Optimization to present their work, share experiences, and discuss recent advances in theory and applications. The primary objectives are:

• exchanging results and experiences in solving real-world combinatorial optimization problems,
• reporting on development and implementation of appropriate models and efficient solution methods for combinatorial optimization problems,
• establishing networking contacts between individuals and research groups working on related topics,
• promoting the work on combinatorial optimization (theory and applications) to the broader scientific community,
• identifying challenging research problems for the field, as well as promising research outlets (both in theory and applications),
• promoting interactions with researchers in other related fields.

Topics of interest

• exact and approximation algorithms for combinatorial optimization problems,
• heuristics and meta-heuristics,
• graph theory and networks,
• cutting and packing, routing, scheduling, location and capacity planning,
• integer programming, global optimization, stochastic integer programming,
• applications in logistics and supply chain management, manufacturing, energy production and distribution, telecommunications, and other fields.
• multiobjective programming

If you intend to attend the conference and you want to receive further information in your e-mail inbox, click the following link:

If you intend to attend the conference, please, fill in the following fields and you will receive in your e-mail inbox the latest news about the conference:

	Name:
	E-mail: