M.W. Padberg, M. Gr#otschel, Polyhedral computations, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 307--360.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....with Gomory s cutting plane method [25, 26, 27] it is of practical relevance. On the one hand, it has stimulated to a certain extent the search for problem specific cutting planes, which became the basis of an own branch of combinatorial optimization, namely polyhedral combinatorics (see, e.g. [28, 39, 41]) On the other hand, Balas et al. 2] successfully incorporated Gomory s mixed integer cuts within a Branch and Cut framework. Third, cutting planes are of interest to mathematical logic and complexity theory. Cook, Coullard, and Turn [15] were the first to consider cutting plane proofs as a ....

....of P I , then P = P I if and only if each row vector of A is saturated w.r.t. P. It was shown in [7] that an integral vector c 2Z is saturated after at most n logkck steps of the GomoryChv tal procedure. Since each 0=1 polytope has a representation Ax 6 b with A2Z (see, e.g. [39]) the known bound of O(n follows. One drawback in this proof is that faces of P that do not contain 0=1 points are taken to have worst case behavior n. The following observation is crucial to derive a better bound. Lemma 3.1. Let cx 6 a be valid for P I and cx 6 g be valid for P, where a 6 g, ....

M. W. Padberg and M. Grtschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307--360. John Wiley, 1985.

....for a scheduling problem on two (non identical) machines with sequence dependent set up times. An obvious mathematical model for this problem is the asymmetric multi traveling salesman problem with separate arc costs for each salesman. Although there is considerable literature on the TSP ATSP [10, 13, 14, 15, 3, 11, 7] as well as on the m ATSP for vehicle routing (see [5] and references therein) it seems that the m ATSP problem in full generality has never been studied from a polyhedral point of view. Existing work on the m ATSP relies on the standard transformation to ATSP (see e.g. 16] or Section 6) which ....

M. Padberg and M. Grotschel. Polyhedral computations. In Lawler et al. [12], chapter 9.

....0 1 ILPs, and also for mixed 0 1 problems, but it is less clear for problems with general integer variables, because when general integer variables are present it is possible for a convex combination of x and x # to be integral even when x # is not. It was later shown by Padberg Grotschel [20] that the extra restriction that the inequality be tight at x does not create any di#culties. Indeed, they showed that an inequality solves the primal separation problem if and only if the same inequality solves the standard separation problem for the point #x # (1 #)x, where # is some ....

M.W. Padberg & M. Grotschel (1985) Polyhedral computations. In E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307--360.

.... 1 h e e if e 2 (H) and h e e if e 62 (H) Now let us consider the implications of these results for separation. It is well known that, although there are an exponential number of SECs, the separation problem for them can be solved in polynomial time (see, e.g. Padberg Gr otschel [27]) Polynomial time separation algorithms are also known for the 2 matching inequalities (Padberg Rao [28] for comb inequalities with a xed number of teeth (Carr [7] and for a certain generalization of comb inequalities when the edges whose variables are positive induce a planar graph ....

M.W. Padberg & M. Grotschel, \Polyhedral computations". In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy-Kan & D. Shmoys (eds.) The Traveling Salesman Problem. Wiley: Chichester, 1985.

....(2.3) has been detected among those for the given pair (i; j) Trying all possible pairs (i; j) then produces an O(n 5 ) overall separation algorithm. Actually, a better algorithm having overall O(n 4 ) time complexity can be obtained, in analogy with the TSP case (see Padberg and Gr otschel [19]) by using the Gomory Hu [8] scheme for the multiterminal ow problem. A simpler algorithm with the same time complexity is based on the simple observation that, for any S, the most violated inequality (2.3) arises when the chosen i and j are such that y i = maxfy v : v 2 Sg and y j = ....

....capacity odd cut problem; hence this separation problem is exactly solvable in polynomial time. This task is however rather time consuming, hence for our branch and cut code we used the following simple heuristic, derived from similar procedures proposed for TSP (see, e.g. Padberg and Gr otschel [19]) Given the fractional point (x ; y ) we de ne the subgraph G = N ; E) induced by E : fe 2 E : 0 x e 1g. We then consider, in turn, each connected component H of G as the handle of a possibly violated generalized 2 matching inequality, whose 2 node teeth ....

M.W. Padberg, M. Grotschel, \Polyhedral computations", [15, Chapter 9].

.... [1] and Balas, Ceria, Cornu ejols Natraj [3] In general, however, it is preferable to use inequalities which take problem structure into account, especially inequalities which are deep in the sense of inducing facets (or faces of high dimension) of the polyhedron P I (see Padberg Gr otschel [19]; Nemhauser Wolsey [18] It is often the case that several classes of deep inequalities are known for a given problem, and frequently each class contains an exponential number of members. To use a particular class of inequalities in practice, one needs to solve the following modi ed separation ....

....to obtaining a viable primal cutting plane algorithm is the use of strong (preferably facet inducing) cutting planes. To our knowledge the rst authors to use strong cutting planes in a primal context were Padberg Hong [20] A detailed description of this paper appears in Padberg Gr otschel [19] and in our paper [16] Padberg and Hong implemented a primal cutting plane algorithm for the Travelling Salesman Problem (TSP) based on facet de ning cuts such as subtour elimination constraints (SECs) and 2 matching, comb and chain inequalities. The algorithms used by Padberg and Hong to ....

[Article contains additional citation context not shown here]

M.W. Padberg & M. Grotschel (1985) Polyhedral computations. In E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307-360.

....Lodi [14] present a polynomial time algorithm for the primal separation of Chv atal comb inequalities for the traveling salesman problem. Up to now, a polynomial time algorithm for the corresponding standard separation problem is not known. Primal separation can be reduced to standard separation [15]. An important question is thus whether polynomial time equivalence of the two problems holds. The solutions to combinatorial optimization problems are often subsets of a given ground set. These solutions can thus be described by their characteristic vectors 2 f0; 1g n . With a combinatorial ....

....problem. 0 1 Primal Separation (0 1 psep) Given a 0 1 point x 2 P and a point x 2 R n , nd a valid inequality of P which is tight at x and not valid for x or assert that no such inequality exists. The implication given in the following theorem can be found as an exercise in [15]. Theorem 3.3. If 0 1 sep can be solved in polynomial time, then 0 1 psep can be solved in polynomial time. The missing implication which settles the polynomial time equivalence of the above problems 0 1 opt 0 1 sep 0 1 psep 0 1 aug Thm. 3.1 Thm. 3.2 Thm. 3.3 Figure 2: The implication ....

M. W. Padberg and M. Grotschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307-360. John Wiley & Sons, 1985.

....(1.1) into a linear programming problem and solve it using LP techniques. This involves identifying classes of inequalities valid for the ECON and NCON problems, and algorithmically finding valid inequalities as necessary. For an overview of the polyhedral approach, see [P83] GP85] 4 and [PG85]. The integer programming formulation (1.1) provides natural classes of inequalities. For the cut inequalities (1.1) i) and node cut inequalities (1.1) ii) we can solve the associated separation problems in polynomical time and have (complicated) characterizations of when they are facets; see ....

M. Padberg and M. Grotschel. Polyhedral Computations. In The Traveling Salesman Problem. Wiley, 307-360, 1985.

....O(n 3 log n) and prove the linear upper and lower bound n for the case P Z n = The basic proof technique here is scaling. Each integral 0=1 polytope can be described by a system of integral inequalities Ax b such that each absolute value of an entry in A is bounded by n n=2 , see e.g. (Padberg Gr otschel 1985). The sequence of integral vectors obtained from a T by dividing it by decreasing powers of 2 followed by rounding gives a better and better approximation of a T itself. One estimates the number of iterations of the Chv atal Gomory rounding procedure needed until the face given by some vector ....

Padberg, M. W. & Grotschel, M. (1985), Polyhedral computations, in E. L. Lawler, J. K. Lenstra, A. Rinnoy Kan & D. B. Shmoys, eds, `The Traveling Salesman Problem', John Wiley & Sons, pp. 307-360.

....Once these cuts are identified, they are typically embedded in a branch and cut enumeration scheme. In this methodology, a search tree is created, but unlike traditional branch and bound, cuts are added to the model at each node of the tree. Issues related to implementation are discussed in [G14, H5, K7, P1]. To date, there have been no applications of cutting plane techniques to bilevel programs. Integer Programming 127 3.4 BENDERS DECOMPOSITION FOR MIXED INTEGER LINEAR PROGRAMMING Enumeration methods discussed in Section 3.2 can be extended directly to solve mixed integer linear programs of ....

M. Grotschel and M.W. Padberg, "Polyhedral Computations," in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Chapter 9, pp. 307--360, John Wiley & Sons, New York (1985).

....with Gomory s cutting plane method [21, 22] it is of practical relevance. On the one hand, it has stimulated to a certain extent the search for problem specific cutting planes which became the basis of an own branch of combinatorial optimization, namely polyhedral combinatorics (see, e.g. [33, 23, 35]) On the other hand, Balas et al. 2] successfully incorporated Gomory s mixed integer cuts within a Branch and Cut framework. Third, since cutting plane theory implies that certain implications in integer linear programming have cutting plane proofs, it is of particular importance in ....

....[6] it is shown that an integral vector c 2 Z n is saturated after at most n 2 lg kck steps of the Gomory Chvtal procedure. Since each 0=1 polytope has a representation Ax 6 b with A 2 Z m Thetan ; b 2 Z m such that each absolute value of an entry in A is bounded by n n=2 (see, e.g. [33]) the known bound of O(n 3 lg n) follows. One drawback in this proof is that faces of P which do not contain 0=1 points are taken to have worst case behavior n. The following observation is crucial to derive a better bound. Lemma 3.1. Let cx 6 a be valid for P I and cx 6 g be valid for P, ....

M. W. Padberg and M. Grtschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307--360. John Wiley, 1985.

....Chvatal [11] showed that the converse holds as well. That is, if all integer points in a nonempty polytope x # R n : Ax # b satisfy an inequality c x # #, for some c # Z n , then there is a cutting plane proof of c x # # from Ax # b. Schrijver extended this result to rational polyhedra [33]. In a way, the sequential order of the inequalities in (1) obscures the (recursive) structure of the cutting plane proof; it is better revealed by a directed graph with vertices 0, 1, 2, m, in which an arc goes from node i to node j i# the i th inequality has a positive coe#cient in the ....

....lemma can be found in [34, p. 340] For a very nice treatment, see also [15, Lemma 6. 33] It allows to use induction on the dimension of the polyhedra considered and provides the key for the termination of the Gomory Chvatal procedure, which was shown by Schrijver for rational polyhedra in [33]. Lemma 1. Let F be a face of a rational polyhedron P . Then F # = P # # F . Lemma 1 yields the following upper bound on the Chvatal rank of rational polytopes in the 0 1 cube with empty integer hull (see [6] for details) Lemma 2. Let P # [0, 1] n be a d dimensional rational polytope in ....

M. W. Padberg and M. Grotschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307--360. John Wiley, 1985.

....for a scheduling problem on two (non identical) machines with sequence dependent set up times. An obvious mathematical model for this problem is the asymmetric multi traveling salesman problem with separate arc costs for each salesman. Although there is considerable literature on the TSP ATSP [10, 13 15, 3, 11, 7] as well as on the m ATSP for vehicle routing (see [5] and references therein) it seems that the m ATSP problem in full generality has never been studied from a polyhedral point of view. Existing work on the m ATSP relies on the standard transformation to ATSP (see e.g. 16] or Section 6) which ....

M. Padberg and M. Grotschel. Polyhedral computations. In Lawler et al. [12], chapter 9.

.... polynomial time, because the facet identification problem for subtour elimination constraints, i.e. the problem to decide which subtour elimination is violated by the current solution, can be solved in polynomial time, despite the fact that their number is exponential (see Padberg and Gr otschel [81]) A natural question to ask is to characterize those classes of instances of the TSP for which the TSP subtour relaxation problem has an integer optimal solution. Obviously, the TSP for these classes can be solved in polynomial time. However, Chv atal [23] has proven that the problem of ....

M.W. Padberg and M. Gr¨otschel, Polyhedral computations, Chapter 9 in [71], 307--360.

....STSP. If every tooth is of size two, we have the blossom inequalities. Let A be the set of edges corresponding to the teeth, then the blossom inequalities can be written as: x(ffi(H) n A) jAj Gamma x(A) 1: To separate the bloosom inequalites, we mimick the technique of Padberg and Grotschel [14]. To modify this procedure to our problem, though, we may not simply identify all of the nurse nodes. The separation algorithm preceeds as follows: Find the components of the graph induced by x, with directions ignored. It is easy to see that there is a violated blossom inequality if and only if ....

....edge (u 1 ; u 2 ) is in the cut corresponding to the edge (v; w) being a tooth. Hence the vertices of all our teeth are patient nodes. In actuality, our implemenation works on a smaller graph achieved by replacing edges with only two, rather than three edges, as suggested by Padberg and Grotschel [14]. Finally we consider comb inequalities. As in the STSP, if S is a set (in our case S P ) and S is tight with respect to our subtour inequalities, that is, x(fl(S) x(ae(S) 1, then we can contract S to a single node. Moreover, if there is a violated blossom inequality in the reduced graph, ....

Padberg, M.W. and Grotschel, M., Polyhedral Computations. In The Traveling Salesman Problem, eds E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Wiley, Chichester, 1985, 307--360.

....LP formulation requires O(mn m 2 ) variables and O(m 3 n) constraints, for a total of thirty six million variables and thirty two trillion constraints. Borrowing several ideas from cutting plane and branch and cut algorithms as described in Junger et al. JRT95] and Padberg and Grotschel [PG85] we reduce the number of variables and constraints by keeping only the tightest inequalities facets of the polyhedral solution space. For a proper treatment of solving physical mapping formulations to optimality using branch and cut approaches, see Christof et al. CJK 97] In this paper, we ....

M. W. Padberg and M. Grotschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Travelling Salesman Problem, pages 307--360. John Wiley & Sons Ltd., 1985.

....special care must be taken as there are more restrictions on the validity of the inequalities in our setting. The separation algorithm for subtour inequalities is a standard application of the maxflow algorithm. To separate the blossom inequality, we modified the algorithm of Padberg and Grotschel [18] which is based on finding a minimum T cut. The heuristic for separating comb inequalities is a modification based on Grotschel and Holland [12] We note that additional modifications are required since there are more restrictions on the validity of these inequalities in our problem. The actual ....

Padberg, M.W. and Grotschel, M., Polyhedral Computations. In The Traveling Salesman Problem, eds E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Wiley, Chichester, 1985, 307--360.

....computer program based on previously published work of others. The cut finding techniques of our program included ffl the Crowder Padberg shrinking procedure [6] ffl the separation algorithm for subtour constraints that solves n 0 1 max flow min cut problems (see, for instance, Section 2. 2 of [21]) ffl the Padberg Rao separation algorithm for blossom constraints [23] ffl the Grotschel Holland comb heuristics [12] ffl the Padberg Rinaldi comb and clique tree heuristics [25] as well as a number of our own innovations (not described in this report) our LP solver was CPLEX, which we ....

M. W. Padberg and M. Grotschel, "Polyhedral computations", in: The Traveling Salesman Problem (E. L. Lawler et al., eds.), Wiley, Chichester, 1995, pp.307--360.

....to find all the inequalities describing P . For example, there are natural ways to formulate the well known travelling salesman problem as an integer program resulting, for n cities, in travelling salesman polytopes in dimension n(n Gamma 1) 2 with 1 2 (n Gamma 1) vertices, see Grotschel and Padberg (1985). Table 1 shows for 5 n 10 the number of vertices and the number of facets (inequalities necessary to describe the polytope) of the travelling salesman polytope. This table, composed from Christof and Reinelt (1995) and Padberg (1995) gives a glimpse of the enormous growth that may occur here. ....

....algorithms. The associated theory can be found in Grotschel, Lov asz, and Schrijver (1988) Making this theory practical, i.e. coming up with algorithms that solve problems of the real world efficiently, requires a lot of additional, often problem specific work. We refer the interested reader to Padberg and Grotschel (1985) for a discussion of the TSP case in this respect. The same approach also applies when we do not know complete inequality systems describing the convex hull, which, in fact, is the usual case. The cutting plane method is again based on separation algorithms, but these implicitly or explicitly ....

[Article contains additional citation context not shown here]

Padberg, M. and Grotschel, M. (1985). Polyhedral computations. In Lawler, Lenstra, Rinnooy Kan, and Shmoys (1985), chapter 9.

No context found.

M.W. Padberg, M. Gr#otschel, Polyhedral computations, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 307--360.

No context found.

Padberg, M., M. GrStschel. 1985. Polyhedral computations. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds, The Traveling Salesman Problem. John Wiley & Sons, Chichester, UK. 307-360.

No context found.

M.W. Padberg & M. Grotschel (1985) Polyhedral computations. In E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307--360. 22

No context found.

M.W. Padberg and M. Grotschel (1985): Polyhedral computations, in: E. Lawler, J. K.

No context found.

M.W. Padberg and M. Gr otschel (1985) "Polyhedral computations" in: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (E. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan end D.B. Shmoys, eds.), John Wiley and Sons.

No context found.

M.W. Padberg and M. Grotschel (1985), Polyhedral computations, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307--360.

First 50 documents

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