×

Intermediate feasibility in 0-1 integer linear systems. (English) Zbl 0588.90059

The authors introduce an intermediate feasibility property for 0-1 integer linear systems and show that the property holds for a 1- matching/covering system which is a generalization of matchings and coverings in a connected undirected network.
Reviewer: M.Frumkin

MSC:

90C09 Boolean programming
68Q25 Analysis of algorithms and problem complexity
90C35 Programming involving graphs or networks
90C10 Integer programming
90C05 Linear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] J. Araoz, private communication (1981).
[2] P.J. Carstensen, ”The complexity of some problems in parametric linear and combinatorial programming,” Ph.D. Dissertation, Department of Mathematics, The University of Michigan (Ann Arbor, MI, 48109, 1983).
[3] P.J. Carstensen, K.G. Murty and C. Perin, ”Prametric specified cardinality 1-matching/covering problem and intermediate feasibility property”, Technical Report 81-6, Department of Industrial and Operations Engineering, The University of Michigan (Ann Arbor, MI, 48109, 1981).
[4] M.R. Garey and D.S. Johnson, Computers and intractability: A Guide to the theory of NP-completeness (W.H. Freeman & Company, San Francisco, CA, 1979).
[5] R.S. Garfinkel and G.L. Nemhauser, ”A survey of integer programming emphasizing computation and relations among models,”, in: T.C. Hu and S.M. Robinson, eds., Mathematical programming (Academic Press, New York, 1973), pp. 77–155.
[6] R.M. Karp, ”Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds., Mathematical Programming (Plenum Press, New York, 1972) pp. 85–103.
[7] I.G. Rosenberg, ”Aggregation of equations in integer programming”, Discrete Mathematics 10 (1974) 325–341. · doi:10.1016/0012-365X(74)90126-5
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.