Concepts of Combinatorial Optimization, is divided into three parts:
- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Keywords: allocation; ben dhaou; crew; task; airline; problem moailaurent; models; teodor; optimization; gabriel; operations; parallel; vandat; combinatorial; fundamental methods; design; network; alain; problems; quilliot