论文信息 - Intermediate feasibility in 0–1 integer linear systems

Intermediate feasibility in 0–1 integer linear systems

The Intermediate Feasibility Property (IFP) is defined for 0–1 integer linear systems. It is shown that IFP holds for 1-matching/covering systems, but not in general. Complexity results are established for checking whether this property holds in other 0–1 systems.

Katta G. Murty | Clovis Perin | Patricia J. Carstensen

[1] Ivo G. Rosenberg,et al. Aggregation of equations in integer programming , 1974, Discret. Math..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] G. Nemhauser,et al. A Survey of Integer Programming Emphasizing Computation and Relations among Models , 1973 .

[4] Patricia J. Carstensen. The complexity of some problems in parametric linear and combinatorial programming , 1983 .