INSTRUCTIONS FOR USING EXPERIMENTAL 0-1 INTEGER LINEAR PROGRAMMING CODE RIP23J
RAND CORP SANTA MONICA CA
Pagination or Media Count:
The program solves integer linear programs of the form P Minimize cx subject to b Ax or 0, x sub j 0 or 1 where c and x are n-vectors, b is an m-vector, and A is m by n. Any bounded integer linear program can be written in this form, using elementary manipulations if necessary. Familiarity with 2 previous papers in the series is assumed.
- Operations Research