Integer programming

Chandru, V and Rao, M R (2010) Integer programming. In: Algorithms and theory of computation handbook. Chapman & Hall/CRC, p. 31.

Full text not available from this repository. (Request a copy)


Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture the feasible set of alternatives, and linear objective functions (to minimize or maximize over the feasible set) that specify the criterion for defining optimality. This algebraic approach permits certain natural extensions of the powerful methodologies of linear programming to be brought to bear on combinatorial optimization and on fundamental algorithmic questions in the geometry of numbers.

Affiliation: Indian School of Business
ISB Creiators:
ISB Creators
Rao, M R
Item Type: Book Chapter
Uncontrolled Keywords: Integer programming, discrete optimization, linear equations
Subjects: Applied Statistics and Computing
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 14:40
Last Modified: 03 Apr 2019 14:40
Publisher URL:
Related URLs:

    Actions (login required)

    View Item View Item
    Statistics for DESI ePrint 748 Statistics for this ePrint Item