Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables

In the first part of this paper, the concept of logical reduction is presented Minimal preferred variable inequalities are introduced, and algorithms are given for their calculation. A simple illustrative example is carried along from the start, further examples are provided later. The second part of the paper describes certain properties of the generated logical inequalities. It then explains some of the decreases of computational effort which may be achieved by the use of minimal preferred inequalities and outlines a number of concrete applications with some numerical results. Finally, a number of more recent concepts and results are discussed, among them the notion of “probing” and a related zero-one enumeration code for large scale problems under the extended control language of MPSX/370.

[1]  Uwe H. Suhl,et al.  Experiments in integer programming , 1980, Discret. Appl. Math..

[2]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[3]  Raymond Breu,et al.  Branch and bound experiments in zero-one programming , 1974 .

[4]  H. P. Williams.  Experiments in the formulation of integer programming problems , 1974 .

[5]  Kurt Spielberg,et al.  ZERO-ONE ZERO-ONE PROGRAMMING AND ENUMERATION , 1975 .

[6]  K. Spielberg.  Plant Location with Generalized Search Origin , 1969 .

[7]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

[8]  Harvey M. Salkin.  Letter to the Editor - On the Merit of the Generalized Origin and Restarts in Implicit Enumeration , 1970, Oper. Res..

[9]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[10]  E. Balas,et al.  Canonical Cuts on the Unit Hypercube , 1972 .

[11]  Paul Larry Harrington.  All-integer integer programming , 1965 .

[12]  M. Guignard,et al.  Reduction Methods for State Enumeration Integer Programming , 1977 .

[13]  J. Krarup,et al.  Selected Families of Location Problems , 1979 .

[14]  Laurence A. Wolsey,et al.  Coefficient reduction for inequalities in 0–1 variables , 1974, Math. Program..

[15]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[16]  K. Spielberg,et al.  On a Production Allocation and Distribution Problem , 1978 .

[17]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .