A heuristic 0-1 integer programming method

A heuristic 0-1 integer programming method

0.00 Avg rating—0 Votes
Article ID: iaor19921919
Country: Germany
Volume: 14
Start Page Number: 11
End Page Number: 18
Publication Date: Mar 1992
Journal: OR Spektrum
Authors:
Keywords: heuristics
Abstract:

In this paper, a novel relaxation method is presented for the integer programming problem: Ax=b, A∈∈¸-1,0,¸+1∈m’×N, x∈∈0,1∈N, N∈m. The report includes experimental results of problems with up to m=100 equations and N=400 variables.

Reviews

Required fields are marked *. Your email address will not be published.