Integer programming problems with bounded variables can be solved by combining the constraints into an equivalent single constraint. This note presents a refinement to earlier work that reduces the size of the coefficients in the equivalent constraint and points out advantages as well as computational considerations for solving problems by this method.
|Original language||English (US)|
|Number of pages||6|
|State||Published - 1977|
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research