M. Grotschel & O. Holland, \Solution of large-scale symmetric traveling salesman problems ". Math. Program., vol. 51, pp. 141-202, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Separation of Split Cuts and Related Inequalities - Caprara, Letchford (1 citation) (Correct)
....a disjunction. We do not address this question in detail here, but we would like to note that: A set H is more likely to be a good handle candidate if x ( H) is close to an odd integer. Good heuristics for nding a handle of a comb already exist, see for example Gr otschel Holland [18] or Padberg Rinaldi [29] To close this section, we mention an open question. Although we have proved that the natural, handle type disjunctions can be used to derive the f0; 1 2 g cuts, we have not shown that the f0; 1 2 g cuts are the only cuts which can be derived in this way. Are there ....
M. Grotschel & O. Holland, \Solution of large-scale symmetric traveling salesman problems ". Math. Program., vol. 51, pp. 141-202, 1991.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
.... (1989a) Traveling salesman problems: Dantzig et al. 1954, 1959) Grotschel and Padberg (1979) Crowder and Padberg (1980) Grotschel (1980) Padberg and Hong (1980) Cornu ejols and Pulleyblank (1982) Grotschel and Pulleyblank (1986) Padberg and Rinaldi (1987,1990,1991) Fischetti (1991a,1992) Grotschel and Holland (1991), Naddef and Rinaldi (1991,1992) Reinelt (1991) Naddef (1992) Clochard and Naddef (1993) Applegate et al. 1994) Balas et al. 1995) Goemans (1995) Fleisher and Tardos (1996) Carr (1997) Trees, forests and arborescences: Gamble and Pulleyblank (1989) Chopra (1989b) Fischetti (1991b) ....
M. Gr otschel and O. Holland (1991) "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming 51 141--202.
Worst-case Comparison of Valid Inequalities for the TSP - Goemans (1995) (14 citations) (Correct)
....for the corresponding separation problem. For this reason, cuttingplane approaches tend to use, in addition to the subtour elimination constraints, the comb inequalities or the clique tree inequalities, see Gr otschel [13] Padberg and Hong [28] Crowder and Padberg [8] Gr otschel and Holland [14], Padberg and Rinaldi [26, 27] J unger et al. 19] and Applegate et al. 1] An exception is a recent implementation of Clochard and Naddef [6] which is based on the path inequalities. The motivation of this paper is best expressed by the following quote from Naddef and Rinaldi [24] For which ....
M. Gr¨otschel and O. Holland. Solution of large-scale symmetric traveling salesman problems. Mathematical Programming, 51:141--202, 1991.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
.... Traveling salesman problems: Dantzig et al. 1954, 1959) Grotschel and Padberg (1979) Crowder and Padberg (1980) Grotschel (1980) Padberg and Hong (1980) Cornu ejols and Pulleyblank (1982) Grotschel and Pulleyblank (1986) Padberg and Rinaldi (1987,1990,1991) Fischetti (1991a,1992) Grotschel and Holland (1991), Naddef and Rinaldi (1991,1992) Reinelt (1991) Naddef (1992) Clochard and Naddef (1993) Applegate et al. 1994) Balas et al. 1995) Goemans (1995) Trees, forests and arborescences: Gamble and Pulleyblank (1989) Chopra (1989b) Fischetti (1991b) Balas and Fischetti (1992) Chopra et al. ....
M. Gr otschel and O. Holland (1991) "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming 51 141--202.
The Use of Dynamic Programming in Genetic Algorithms for.. - Yagiura, IBARAKI (1996) (3 citations) (Correct)
....vertex in tour . A tour is optimal if it minimizes n01 X i=1 d (i) i 1) d (n) 1) 27) Numerous exact and approximate algorithms have been proposed for this problem [14] and it is reported that exact optimal solutions have been obtained for problem instances of up to n = 2000 3000 [8, 19] (500,000 in the case of asymmetric version [16] 5.1 Genetic DP Algorithm In this section, we explain the details of steps 1 and 2 of genetic DP for TSP. 5.1.1 Step 1 (Initialize) We use the arbitrary insertion method [14, 22] for generating initial candidate solutions. It is a greedy method and ....
Grotschel, M., and Holland, O., \Solution of Large-Scale Symmetric Traveling Salesman Problems," Mathematical Programming 51 (1991) 141-202.
Evolution in Time and Space - The Parallel Genetic Algorithm - Mühlenbein (1991) (1 citation) (Correct)
....2 opt with the more complicated Lin Kernighan [LK73] neighborhood. In the latter case they used a pair of improvement operators, the dynamical k swap and the additional 4 swap as described in [LK73] The results are shown in table 3. The problem instances starting with GRO can be found in [GH88] GRO532 is the Padberg Rinaldi problem mentioned above. The reference point is given by simulated annealing SA according to the cooling schedule of Aarts et al. AK89] The results demonstrate the advantage of the MPX crossing over. The genetic versions Gen2Opt and GenLK of 2 Opt and ....
M. Gr¨otschel and O. Holland. Solution of large-scale symmetric traveling salesman problems. Technical report, Institut f. ¨ Okonometrie und Operations Research, University of Bonn, Report No. 88506-OR, 1988.
Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (1 citation) (Correct)
No context found.
M. Gr otschel and O. Holland (1991) "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming 51 141--202.
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