everything.study
ORI 391Q.6

Algorithms for Mixed Integer Programming

3 Hours

Methods and software for solving large-scale mixed integer programming problems: intelligent heuristics, decomposition, lower bounding schemes, limited enumeration, and simple methods for quickly finding good feasible solutions. Numerous examples taken from industry.

Prerequisites & course information

Methods and software for solving large-scale mixed integer programming problems: intelligent heuristics, decomposition, lower bounding schemes, limited enumeration, and simple methods for quickly finding good feasible solutions. Numerous examples taken from industry.

Sources