reduction of integer programs to accelerate a multiple choice programming algorithm
Recently, it has been shown in [1],[2] and [3] how to reduce an integer linear programming problem with m constraints and bounded variables to an equivalent integer linear programming problem with only one constraint and bounded variables. In [4] it has been shown that for a particular choice of the reduction it is possible to accelerate the calculations for heuristic integer linear programming algorithms. This paper discusses how to accelerate Balintfy and Blackburn's heuristic algorithm for multiple choice programming [5].
multiple choice programming integer linear programming mathematical programming