Approximation Algorithms and Linear Programming
Completed by Matej Kerekrety
December 3, 2024
46 hours (approximately)
Matej Kerekrety's account is verified. Coursera certifies their successful completion of Approximation Algorithms and Linear Programming
What you will learn
Formulate linear and integer programming problems for solving commonly encountered optimization problems.
Develop a basic understanding of how linear and integer programming problems are solved.
Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution
Skills you will gain
- Category: Mathematical Software
- Category: Graph Theory
- Category: Model Optimization
- Category: Algorithms
- Category: Operations Research
- Category: Network Model
- Category: Theoretical Computer Science
- Category: Python Programming
- Category: Mathematical Modeling
- Category: Combinatorics
