This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts.
Polyhedral approaches to mixed integer linear programming
CONFORTI, MICHELANGELO;
2010
Abstract
This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.