Approximation Algorithms and Linear Programming
Completed by Travis Sloneker
December 10, 2024
46 hours (approximately)
Travis Sloneker'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: Graph Theory
- Category: Theoretical Computer Science
- Category: Model Optimization
- Category: Network Analysis
- Category: Network Model
- Category: Algorithms
- Category: Python Programming
- Category: Combinatorics
- Category: Mathematical Modeling
- Category: Operations Research

