1972•ACM SIGMAP BulletinOpen access

Integer programming

C. A. Haverly

Abstract

Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values such as 0, 1, 2, 3, or 4.

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Integer (computer science), Integer programming, Radical of an integer, Integer points in convex polyhedra, Branch and price, Mathematics, Multiple, Prime factor