论文信息 - NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron

NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron

A, an integral vector b and some rational vector , decide whether is outside the elementary closure , is NP-complete. This result is achieved by an extension of a result by Caprara and Fischetti.

Friedrich Eisenbrand | F. Eisenbrand

[1] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[2] William J. Cook,et al. Combinatorial optimization , 1997 .

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

[4] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.