Work

Integer Programming

Year: 1998

Type: book-chapter

Abstract: 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.

Source: Chapman & Hall/CRC applied algorithms and data structures series

DOI: 10.1201/9781420049503-c33

Authors: Vijay Chandru, M Rao

Institutions: National Institute of Advanced Studies, Indian School of Business

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2912272002

FWCI:

Cites: 120

Cited by: 9

Related to: 10