Weixiong Zhang  Home/Search
Context Related
| wustl.edu/~zhang/p...tspaaai93symp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wustl.edu/~zhang/publicat...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Branch-and-bound (BnB) is a general problem solving paradigm, especially useful for finding optimal solutions to most NP-hard combinatorial problems. In fact, BnB can also be adapted as an efficient approximation algorithm, providing a promising new alternative in practice. We show this by an approximation scheme for the asymmetric traveling salesman problem (ATSP). Our method is BnB truncated at different stopping points, depending upon the total computation available. Experiments... (Update)
Context of citations to this paper: More
.... based on patching together the cycles in a minimum cycle cover, the best of which are variants on an algorithm proposed by Zhang [Zha93]. We test implementations of the main contenders from each class on a variety of instance types, introducing a variety of new random...
.... there has been no broad based study covering a full range of ATSP heuristics and what ATSP studies there have been, such as [13, 30, 31, 32], have concentrated mostly on the TSPLIB instances and randomly generated instances with no obvious connection to applications. Nor...
Cited by: More
Improving Table Compression with Combinatorial Optimization - Buchsbaum, Fowler, Giancarlo (2002) (Correct)
Flexible and Approximate Computation - Through State-Space Reduction (Correct)
Iterative State-Space Reduction for Flexible Computation - Zhang (2000) (Correct)
Active bibliography (related documents): More All
1.9: epsilon-Transformation: Exploiting Phase Transitions to.. - Zhang, Pemberton (1994) (Correct)
0.8: Depth-First Branch-and-Bound versus Local Search: A Case Study - Zhang (Correct)
0.7: Well-Solvable Special Cases of the TSP: A Survey - Burkard, Deineko, van Dal.. (1995) (Correct)
Similar documents based on text: More All
0.4: The Probabilistic Relationship between the Assignment and.. - Frieze, Sorkin (2001) (Correct)
0.3: Searching for Backbones and Fat: A Limit-Crossing Approach.. - Climer, Zhang (2002) (Correct)
0.2: User's Guide to - Version January (Correct)
Related documents from co-citation: More All
9: The traveling salesman problem and minimum spanning trees: Part II (context) - Held, Karp - 1971
5: Local search for the asymmetric traveling salesman problem (context) - Kanellakis, Papadimitriou - 1980
5: Some new branching and bounding criteria for the asymmetric travelling salesman .. (context) - Carpaneto, Toth - 1980
BibTeX entry: (Update)
W. Zhang. Truncated branch-and-bound: A case study on the asymmetric tsp. In Working Note of AAAI 1993 Spring Symposium: AI and NP-Hard Problems, pages 160--166, Stanford, CA, March 22-25 1993. http://citeseer.ist.psu.edu/zhang93truncated.html More
@misc{ zhang93truncated,
author = "W. Zhang",
title = "Truncated branch-and-bound: A case study on the asymmetric tsp",
text = "W. Zhang. Truncated branch-and-bound: A case study on the asymmetric tsp.
In Working Note of AAAI 1993 Spring Symposium: AI and NP-Hard Problems,
pages 160--166, Stanford, CA, March 22-25 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/zhang93truncated.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey - 1979
193 The Traveling Salesman Problem (context) - Lawler, Lenstra et al. - 1985
141 An effective heuristic algorithm for the traveling salesman .. (context) - Lin, Kernighan - 1973
100 Branch-and-bound methods: A survey (context) - Lawler - 1966
98 Local optimization and the traveling salesman problem (context) - Johnson - 1990
42 Generalized best-first search strategies and the optimality (context) - Dechter - 1985
31 the worst-case performance of some algorithms for the asymme.. (context) - Frieze, Galbiati et al. - 1982
27 Branch and bound methods (context) - Balas - 1985
25 Probabilistic analysis of heuristic (context) - Karp - 1985
24 A patching algorithm for the nonsymmetric Traveling-Salesman.. (context) - Karp - 1979
20 Exact solution of large asymmetric traveling salesman proble.. (context) - Miller - 1991
16 Local search for the asymmetric traveling salesman problem (context) - Kanellakis - 1980
16 personal communications (context) - Miller - 1992
12 Flowshop scheduling with limited temporary storage (context) - Papadimitriou - 1980
11 Enumerative and iterative computational approaches (context) - Kohler - 1976
10 Linear assignment problems (context) - Martello - 1987
10 Some new branching and bounding criteria for the asymmetric .. (context) - Carpaneto - 1980
7 An average-case analysis of branch-and-bound with applicatio.. (context) - Zhang - 1992
6 the flowshop sequencing problem with no wait (context) - Reddi - 1972
5 Using branch-and-bound algorithms to obtain suboptimal solut.. (context) - Ibaraki, Muro et al. - 1983
2 Some examples of difficult traveling salesman problems (context) - Papadimitriou - 1978
2 An experimental investigation and comparative evaluation of .. (context) - Ashour - 1970
2 the asymmetric traveling salesman problem under subtour elim.. (context) - Zhang
2 Search, branch-and-bound (context) - Kumar - 1992
1 Performance of linearspace branch-and-bound algorithms (context) - Zhang - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://siesta.wustl.edu/~zhang/publications/index.html): More
A Template-Based and Pattern-Driven Approach to Situation.. - Zhang, al. (2000) (Correct)
Depth-First Branch-and-Bound versus Local Search: A Case Study - Zhang (Correct)
The Asymmetric Traveling Salesman Problem.. - Cirasella.. (2001) (Correct)
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