A. Schrijver, On cutting planes, Ann. Discrete Math. 9 (1980) 291--296.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....satisfying all Gomory Chv atal cutting planes for P is called the elementary closure P 0 of P . Thus, if P is de ned by the system Ax b, where A 2 Z m n and b 2 Z m , then P 0 is de ned as P 0 = 2R m 0 T A2Z n ( T Ax b T bc) 19) A crucial observation made by Schrijver (1980) is that the weight vectors can be chosen such that 0 1. This holds because an inequality T Ax b T bc with 2 R m 0 and T A 2 Z n is implied by Ax b and ( b c) T Ax b( b c) T bc, since T Ax = b c) T Ax b c T Ax b( b c) T bc b c T b = b ....

....0 = 0 1 T A2Z n ( T Ax b T bc) 21) An integer vector c 2 Z n of the form c T = T A, where 0 1; has in nity norm kck1 kA T k1 k k1 kA T k1 . Therefore the elementary closure P 0 of a rational polyhedron is a rational polyhedron again, as observed by Schrijver (1980). Proposition 3 (Schrijver 80) If P is a rational polyhedron, then P 0 is a rational polyhedron. 4.1 Complexity of the elementary closure An important question is, whether one can optimize in polynomial time over the elementary closure of a polyhedron. Gr otschel, Lov asz Schrijver (1988) ....

[Article contains additional citation context not shown here]

Schrijver, A. (1980), `On cutting planes', Annals of Discrete Mathematics 9, 291 - 296.

....P I of P, i.e. the convex hull of the integral points in P is contained in P 0 . Furthermore P 0 = P if and only if P = P I . If we define P (0) P and, recursively, P (t 1) P (t) 0 for all nonnegative integers t, then P I P (t) for all nonnegative integers t. Schrijver [Sch80] showed that P 0 is again a polyhedron and that there is a nonnegative integer t such that P (t) P I . The (Gomory Chvtal) rank of P is the smallest t such that P (t) P I . Let ax 6 b be a valid inequality for P I . Its depth relative to P is the smallest d such that ax 6 b is valid ....

A. Schrijver. On cutting planes. In M. Deza and I. G. Rosenberg, editors, Combinatorics '79, Part II, volume 9 of Annals of Discrete Mathematics, pages 291 -- 296. North--Holland, Amsterdam, 1980.

....2 Pg, is called a Gomory Chv atal cutting plane. The set of vectors P 0 satisfying all cutting planes for P is called the elementary closure of P . Let P (0) P and P (i 1) P (i) 0 , for i 0. Chv atal (1973) showed that every polytope P satis es P (t) P I for some t 2 N 0 . Schrijver (1980) extended this result to rational polyhedra. The number of iterations t until P (t) P I is not polynomial in the size of the description of P , even in xed dimension (Chv atal 1973) Yet, if P I = and P R n , Cook, Coullard Tur an (1987) showed that there exists a number t(n) such ....

....form T A; 2 [0; 1] m . This upper bound is exponential in the encoding length of A, even in xed dimension. One can further restrict the cutting planes c T x bc to those corresponding to a totally dual integral (TDI) system de ning P (Edmonds Giles 1977, Giles Pulleyblank 1979, Schrijver 1980). The number of inequalities of a minimal TDI system for a polyhedron P can still be exponential in the size of P , even in xed dimension (Schrijver 1986, p. 317) The contributions of this paper are twofold. In the rst part, we prove that in xed dimension the number of inequalities needed to ....

Schrijver, A. (1980), `On cutting planes', Annals of Discrete Mathematics 9, 291 - 296.

.... combinatorial convexity and Supported by a Gerhard Hess Forschungsforderpreis of the German Science Foundation (DFG) toric varieties (cf. e.g. DHH98] Ewa96] Oda88] Stu96] polynomial rings and ideals (cf. e.g. BG98] BGT97] or in integer programming (cf. e.g. Gra75] GP79] [Sch80], Seb90] Wei98] their structure is not very well understood yet. A first systematic study was given by Sebo [Seb90] In particular, the following three conjectures about the nice geometrical structure of Hilbert bases of an integral pointed polyhedral cone C ae R n are due to him: ....

A. Schrijver, On cutting planes, Ann. Discrete Math. 9 (1980), 291-- 296.

....= P (t) 0 for non negative integers t (we will think of P 0 as defining an operator 0 : P P 0 which we call the Gomory Chv atal operator) Obviously P P (t) P I . Chv atal [2] showed that if P is a polytope, there exists some t 0 such that P (t) P I (see also Schrijver [15]) the smallest number t for which this holds is the Chv atal rank of P . Bockmayr and Eisenbrand [1] proved that P Q n ) P (t) P I for t 6n 3 log n (this upper bound has been improved to 3n 2 log n by Eisenbrand and Schulz [7] In contrast to the matrix cut operators, the separation ....

A. Schrijver. On cutting planes, in Combinatorics 79 Part II, Annals of Discrete Mathematics 9 (M. Deza and I. G. Rosenberg, eds.), North Holland, Amsterdam, 1980, pp. 291--296.

....x fi whenever a 2 ZZ N ; fi 2 ZZ; and maxfax : x 2 Pg fi 1g, then P 0 can be seen as obtained from P by one step of rounding. If we define P (0) P and, recursively, P (t 1) P (t) 0 for all positive integers t, then P I P (t) for all nonnegative integers t. Schrijver [Sch80] showed that P 0 is again a polyhedron and that there is a nonnegative integer t such that P (t) P I . The rank of P is the smallest t such that P (t) P I . Let a x fi be a valid inequality for P I . Its depth relative to P is the smallest d such that a x fi is valid for P (d) ....

A. Schrijver. On cutting planes. In M. Deza and I. G. Rosenberg, editors, Combinatorics '79, Part II, volume 9 of Annals of Discrete Mathematics, pages 291 -- 296. North--Holland, Amsterdam, 1980.

....(1973) proved that all inequalities necessary to describe the convex hull of integer solutions can be obtained by taking linear combinations of the original and previously generated linear inequalities and then applying a certain rounding scheme, provided that the integer solutions are bounded. Schrijver (1980) proved the more general result that it is possible to generate the convex hull of integer solutions by applying a finite number of operations to the linear formulation containing the integer solutions, starting with P , if P is rational but not necessarily bounded. The results by Gomory, ....

....of problems for which polyhedral results are known, will be discussed in the accompanying Part II of this paper. Research carried out in the Netherlands involves both theoretical and more problem specific results. Gerards and Schrijver have considered several important theoretical issues, see e.g. Schrijver (1980,1981) Grotschel, Lov asz and Schrijver (1981) Cook, Gerards, Schrijver and Tardos (1986) Here we also want to mention the result of H.W. Lenstra (1983) that the integer programming problem (1) can be solved in polynomial time for a fixed number of variables. Although not specifically a result ....

[Article contains additional citation context not shown here]

A. Schrijver (1980) "On cutting planes", [in: Combinatorics 79 Part II (M. Deza and I.G. Rosenberg, eds.)] Annals of Discrete Mathematics 9 291--296.

....c k p k C derive P k dc k p k dC, where d is an arbitrary positive integer. Cutting plane system is also a refutation system: we want to refute a set of inequalities by deriving a contradiction, represented as 0 1. The completeness of this system was proved by Gomory [12] see also Schrijver [25] for an extension) For an exposition of cutting plane algorithms see e.g. 20, 8] The expressive power of inequalities is at least as big as of clauses: the validity of a clause W k2I p k W k2J :p k is equivalent to P k2I p k P k2J (1 Gamma p k ) 1; which can be rewritten into the ....

A. Schrijver, On cutting planes, in: Combinatorics 79, part II, Annals of Discrete Math. 9, eds. M. Deza and I.G. Rosenberg, 1980, North-Holland, 291-296.

No context found.

A. Schrijver, On cutting planes, Ann. Discrete Math. 9 (1980) 291--296.

No context found.

Schrijver, A. 1980. On cutting planes. M. Deza and I. G. Rosenberg, eds., Combinatorics 79 Part II, Annals of Discrete Mathematics 9. North Holland, Amsterdam, pp. 291-- 296.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC