5  5 reviews on Coursera

Solving Algorithms for Discrete Optimization

Discrete Optimization aims to make good decisions when we have many possibilities to choose from.
Course from Coursera
 3147 students enrolled
 en
Basic Constraint Programming
Advanced Constraint Programming
Mixed Integer Programming
Local Search

Discrete Optimization aims to make good decisions when we have many possibilities to choose from. Its applications are ubiquitous throughout our society. Its applications range from solving Sudoku puzzles to arranging seating in a wedding banquet. The same technology can schedule planes and their crews, coordinate the production of steel, and organize the transportation of iron ore from the mines to the ports. Good decisions on the use of scarce or expensive resources such as staffing and material resources also allow corporations to improve their profit by millions of dollars. Similar problems also underpin much of our daily lives and are part of determining daily delivery routes for packages, making school timetables, and delivering power to our homes. Despite their fundamental importance, these problems are a nightmare to solve using traditional undergraduate computer science methods.

Solving Algorithms for Discrete Optimization
Free
per course
Incentives
100% online
Flexible deadlines
Intermediate Level
Approx. 22 hours to complete
English
Also check at

FAQs About "Solving Algorithms for Discrete Optimization"

About

Elektev is on a mission to organize educational content on the Internet and make it easily accessible. Elektev provides users with online course details, reviews and prices on courses aggregated from multiple online education providers.
DISCLOSURE: This page may contain affiliate links, meaning when you click the links and make a purchase, we receive a commission.

SOCIAL NETWORK