Integer and combinatorial optimization
Integer and combinatorial optimization
| Hi-index | 0.00 |
This book is based on a series of ten lectures given by Cornuéjols at a CBMS-NSF regional conference in 1999. It is a monograph on the polyhedral combinatorics of packing and covering problems. The fundamental approach is to formulate a combinatorial optimization problem as an integer linear programming problem and then determine conditions under which the feasible region of the linear programming (LP) relaxation of the problem has integral vertices. In such cases, the problem can be solved efficiently by simply solving the LP relaxation.