traff@uunet.UU.NET (Jesper L. Traff) (01/18/89)
To people working on binary integer programming problems. At the University of Copenhagen we are currently implementing a parallel implicit enumeration algorithm for solving general binary linear integer programming problems. So far our programs (written in C for a 32 node Intel hypercube) seems to work well, but we lack medium to large problem instances to make more interesting performance tests. Anybody on the net who can supply us with such test cases?? Problem sizes prefered: 50 to 100 variables and 20 to 50 constraints, no special representation required (we use an adjacency list representation of the constraint matrix, but we can convert to this representation ourselves) regards and thanks in advance Jesper Larsson Traff DIKU, Deptartment of Computer Science, University of Copenhagen, Denmark e-mail: traff@diku.dk