An implicit enumeration program for zero-one integer programming | Zendy

Toshihide Ibaraki | Zendy; T. K. Liu | Zendy; C.R. Baugh | Zendy; Saburo Muroga | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An implicit enumeration program for zero-one integer programming

Author(s) -

Toshihide Ibaraki,

T. K. Liu,

C.R. Baugh,

Saburo Muroga

Publication year - 1972

Publication title -

international journal of computer and information sciences

Language(s) - English

Resource type - Journals

ISSN - 0091-7036

DOI - 10.1007/bf01108520

Subject(s) - enumeration , integer programming , integer (computer science) , zero (linguistics) , variable (mathematics) , mathematics , current (fluid) , code (set theory) , computer science , mathematical optimization , algorithm , discrete mathematics , programming language , mathematical analysis , linguistics , philosophy , set (abstract data type) , electrical engineering , engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research