C++Now 2014 has ended
Please visit the C++Now website.
Back To Schedule
Friday, May 16 • 11:00am - 12:30pm
How to Design C++ Implementations of Complex Combinatorial Algorithms

Log in to save this to your schedule, view media, leave feedback and see who's attending!

This presentation will focus on one specific way of designing optimization frameworks. We will face the problem of designing combinatorial algorithms to be general and easy to extend as well as providing a user friendly interface. We mainly will make use of templates, including the features introduced in C++11.

As an example problem we will consider the local search meta-heuristic. Local search is one of the most popular optimization methods. On the one hand, it is a natural way of tackling problems and on the other, it achieves very good results in practice. It is worth mentioning that local search is a generalization of many other well known optimization heuristics such as simulated annealing.

The presentation is for those interested in designing complex algorithms, in template metaprogramming, or in optimization. C++11 skills are essential to understand some parts of the presentation.

avatar for Piotr Wygocki

Piotr Wygocki

Piotr Wygocki graduated from the University of Warsaw with a double master's degree in Computer Science and Mathematics. He has experience both in the theoretical and commercial aspects of computer science. He completed an internship at Centrum Wiskunde Informatica in Amsterdam, which... Read More →

Friday May 16, 2014 11:00am - 12:30pm MDT

Attendees (0)