Skip to product information
1 of 1

Integer Programming and Combinatorial Optimisation

Integer Programming and Combinatorial Optimisation

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Duration: Not defined

Level: Graduate

Certification: No

Cost: Free

Language: English

Type: Self-Paced



Please note: these courses are provided by external sources, links are not actively managed or regularly updated, content might be moved or unavailable.
View full details