s6v01 Branch and Bound para PLI: Introdução, Exemplo pt.1 (IOCA)

Course "Introduction to Applied Combinatorial Optimization" taught by Professor Mário César San Felice (http://www.dc.ufscar.br/~mario) from the Department of Computer Science (DC) at the Federal University of São Carlos (UFSCar). Registration via Google Classroom (http://classroom.google.com/) with class code omfdm4l Abstract: This mini-course aims to introduce students to some of the main techniques used in solving combinatorial optimization problems. More specifically, greedy algorithms, local search heuristics, randomness, and integer linear programming will be covered. The area of ​​combinatorial optimization is of great interest in computer science theory because its problems are challenging and require the development of sophisticated algorithms. These problems also have great practical relevance, as they model scenarios that naturally arise in computing and in various areas of industry.