Electronic Resource
Springer
International journal of parallel programming
1 (1972), S. 75-92
ISSN:
1573-7640
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper describes some techniques to improve the speed of the implicit enumeration method for solving zero-one integer programming problems. Among these techniques, the most powerful is the one of using a column vector which works as a tag for each inequality, indicating whether or not the inequality should be checked for the current partial solution. A new condition for underlining a variable and the concept of pseudo-underlining are also proposed. These techniques were implemented in the computer programil lip (ILLinois Integer Programming code). The computational results for different types of problems are discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01108520
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
