Lecture
Optimization: Classical Problems
Description
This lecture covers classical optimization problems, including the knapsack problem and the traveling salesman problem. It explains brute force algorithms, computational time complexities, and integer linear optimization. The instructor discusses feasible solutions, polyhedrons, and integer lattices.
Instructor
in proident deserunt
Ullamco nisi incididunt non reprehenderit proident esse amet esse deserunt eu minim ullamco duis. Consectetur veniam sint incididunt aliqua nostrud. Ipsum dolor dolore voluptate duis Lorem excepteur. Amet Lorem aute aliquip et. Ullamco aliqua aliqua id esse. Id incididunt minim et dolore magna adipisicing qui reprehenderit.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (42)
Integer Optimization: Theory and Applications
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.