M. Grotschel and M. Padberg. Polyhedral theory. In E.L. Lawler et al., editors, The Traveling Salesman Problem, pages 251-360. Wiley, Chichester, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....jEj jF [ W j 1 anely independent points in P (F ) This will prove dim(P (F ) jEj jF [ W j, and hence the theorem. The proof of the claim is by induction on the cardinality of F . When jF j = n the claim is true, since P (F ) corresponds to the TSP polytope (see, e.g. Gr otschel and Padberg [7]) 5 Assume now the claim holds for jF j = and consider any node set F with jF j = 1. Let v be any node not in F , and de ne F : F [ fvg. Because of the induction hypothesis, there exist jEj jF [ W j 1 anely independent points belonging to P (F ) hence to P (F ) If v 2 W ....

....ning for P (F n fug) where u is an arbitrary value if u 2 W , whereas u = minf v (1 y v ) x; y) 2 P (F n fug) and y u = 0g holds when u 62 W . Proof. The thesis follows from the well known sequential lifting theorem (Padberg [15] as described, e.g. in Gr otschel and Padberg [7]. 2 Theorem 2.2 leads to a lifting procedure to be used to derive facet inducing inequalities for the GTSP polytope from those of the TSP polytope. To this end one has to choose any lifting sequence for the nodes, say fv 1 ; v n g, and iteratively derive a facet 6 of P (fv t 1 ; v ....

[Article contains additional citation context not shown here]

M. Grotschel, M.W. Padberg, \Polyhedral theory", [10, Chapter 8].

....hypothesis. Proposition 3.1 dim(P ) jEj jV j 3jV j 1. Proof. Recall that we are assuming jV j 5. Then dim(P ) dim(H(0; 0; 0) P ) dim(H(0; 0; 0) Q) jV j 1) by Lemma 3. 1 using any sequence) dim(Q) jV j 1) jEj jV j (jV j 1) see Gr otschel and Padberg [8]) Now, dim(P ) jEj jV j 3jV j 1 since the RSP can be described with jEj jV j variables and jV j type (4) jV j 1 type (5) and jV j type (9) 10) linearly independent equality constraints. Another important consequence of Lemma 3.1 is that any facet de ning inequality x y ....

....; v j ] together with the assignment of v k to any vertex of the cycle, yields an (x; y) vector of P such that x ij = 0. Hence, dim(f(x; y) 2 P : x ij = 0g) dim(f(x; y) 2 Q : x ij = 0g) jV j 1) jEj jV j 1) jV j 1) since x ij 0 induces a facet of Q (see Gr otschel and Padberg [8]) The thesis then follows from Proposition 3.2. Note at this stage that the inequality x ij 1 is not facet inducing since it is dominated by the connectivity constraint (12) 7 Proposition 3.3 The inequality y ij 0 de nes a facet of P for each (v i ; v j ) 2 A; i 6= j and i 6= 1. Proof. ....

[Article contains additional citation context not shown here]

M. Grotschel, M.W. Padberg, \Polyhedral Theory", in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (eds), Wiley, Chichester, 251-305, 1995.

....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 ....

....is therefore not in the span of the columns of F n f121g. We conclude that the columns of F are linearly independent. To complement this upper bound on the dimension of P n with a lower bound we will need a standard construction of linearly independent tours for the ATSP. Theorem 3. 3 (see [10]) Let D V be the complete digraph on nodes V = f0; ng with n 2. There exist n(n 1) tours in D V that are linearly independent with respect to the arcs not incident to 0. Proof. Follows directly from [10] proof 1 of Theorem 7 and Theorem 20. Now we are ready to determine the dimension ....

[Article contains additional citation context not shown here]

M. Grotschel and M. Padberg. Polyhedral theory. In Lawler et al. [12], chapter 8.

....optimization and integer programming. In spite of the large research e ort, however, polynomial time exact separation procedures are known for only a few classes of facet de ning TSP cuts. In particular, no ecient separation procedure is known at present for the famous class of comb inequalities [22]. The only exact method is due to Carr [8] and requires O(n 2t 3 ) time for separation of comb inequalities with t teeth on a graph of n nodes. Applegate, Bixby, Chv atal and Cook [1] recently suggested concentrating on maximally violated combs, i.e. on comb inequalities which are violated by ....

....in continuous line (the nonnegativity inequalities used in the derivation are not indicated) The simplest case of comb inequalities arises for jT i j = 2 for i = 1; t, leading to the Edmonds 2 matching constraints. It is well known that comb inequalities de ne facets of the TSP polytope [22]. Also well known is that comb inequalities are mod 2 cuts obtained by weighing by 1=2 and combining the following constraints: x( v) 2; for all v 2 H x(E(T i ) jT i j 1; for i = 1; t x(E(T i H) jT i Hj 1; for i = 1; t such that jT i Hj 2 x(E(T i n H) jT i n ....

[Article contains additional citation context not shown here]

M. Grotschel, M. Padberg (1985). Polyhedral theory. E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 251-305. 25

....this polytope correspond to the three possible tours on four nodes. The values of the other variables can be computed using the minimal equation system (in fact, one further variable could be eliminated because the degree equation for node 1 is still present) Starting with the pioneering work of Gr otschel and Padberg[1985], a host of valid and facet de ning inequalities of P n TSP were identi ed. Among them are the trivial inequalities 0 x e 1, for all e 2 E n , and the subtour elimination constraints x( W ) 2, for all W V n ; 3 jW j n 3, which model that cycles containing fewer than n nodes have to ....

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

....1 are established in Section 4 and interpreted in Section 5. Finally, we conclude with some remarks in Section 6. 2 Background material We assume a basic knowledge of polyhedral combinatorics, especially related to the travelling salesman problem. The reader is referred to Gr otschel and Padberg [16] or Pulleyblank [29] for a very thorough introduction. Table 1: Strength of TSP inequalities. Class of inequalities Strength Ref. Comb with t teeth 3t 1 3t Cor. 4 in general 10 9 Cor. 4 Clique tree with h handles and t teeth 3t 2h Gamma1 3t h Gamma1 Thm. 3 with h handles 8h 2 7h 2 Cor. 4 in ....

....[22] and Fonlupt and Naddef [10] GTSP is full dimensional since it is of blocking type, i.e. if x 2 GTSP and y x then y 2 GTSP . Many classes of facet defining valid inequalities are known for GTSP . The simplest is the class of subtour elimination constraints (also called loop constraints in [16] or cocycle inequalities in [25] x(ffi(S) 2 for any S ae V , where x(F ) P e2F x e and ffi (S) represents the coboundary of S defined as fe = i; j) jS fi; jgj = 1g. Naddef and Rinaldi [25] have shown that any facet defining inequality for STSP gives rise to a facetdefining inequality ....

[Article contains additional citation context not shown here]

M. Gr¨otschel and M. W. Padberg. Polyhedral theory. In E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, editors, The traveling salesman problem: A guided tour of combinatorial optimization. John Wiley and Sons, 1985.

No context found.

M. Grotschel and M. Padberg. Polyhedral theory. In E.L. Lawler et al., editors, The Traveling Salesman Problem, pages 251-360. Wiley, Chichester, 1985.

No context found.

M. Grotschel, M.W. Padberg, \Polyhedral Theory", in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (eds), Wiley, Chichester, 251-305, 1995.

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