Christian Wagner
Broschiertes Buch

Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory

Versandkostenfrei!
Versandfertig in 1-2 Wochen
27,25 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
0 °P sammeln!
This thesis deals with the generation, evaluation, and analysis of cutting planes for mixed-integer linear programs (MILP¿s). Such optimization problems involve finitely many variables, some of which are required to be integer. The aim is to maximize or minimize a linear objective function over a set of finitely many linear equations and inequalities. Many industrial problems can be formulated as MILP¿s. The presence of both, discrete and continuous variables, makes it difficult to solve MILP¿s algorithmically. The currently available algorithms fail to solve many real-life problems in acce...