G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA Journal of Computing, vol. 3, pp. 376--384, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Study of Concurrency in the Ant Colony System Algorithm - Daniel (2006) (Correct)
No context found.
G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA Journal of Computing, vol. 3, pp. 376--384, 1991.
Postponing Branching Decisions - Willem Jan Van (Correct)
No context found.
G. Reinelt, `TSPLIB - a Traveling Salesman Problem Library', ORSA Journal on Computing, 3, 376--384, (1991).
Postponing Branching Decisions - van Hoeve, Milano (2004) (Correct)
No context found.
G. Reinelt, `TSPLIB - a Traveling Salesman Problem Library', ORSA Journal on Computing, 3, 376--384, (1991).
Constructing Test Functions for Global Optimization Using.. - Balasundaram, Butenko (2005) (Correct)
No context found.
Reinelt, G., 1991, TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing, 3, 376--384.
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
No context found.
G. Reinelt. TSPLIB -- A traveling salesman problem library. ORSA Journal on Computing, 3:376--384, 1991.
Generic Heuristics for Combinatorial Optimization Problems - Affenzeller, Mayrhofer (2002) (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
A Random-Key Genetic Algorithm for the Generalized Traveling.. - Snyder, Daskin (2004) (2 citations) (Correct)
No context found.
G. Reinelt. TSPLIB---a traveling salesman problem library. ORSA Journal on Computing, 3(4):376--384, 1991.
Memetic Algorithms for Combinatorial Optimization Problems.. - Merz (2001) (8 citations) (Correct)
No context found.
G. Reinelt, "TSPLIB--- A Traveling Salesman Problem Library," ORSA Journal on Computing, vol. 3, no. 4, pp. 376--384, 1991.
SASEGASA: An Evolutionary Algorithm for Retarding Premature .. - Affenzeller, Wagner (2003) (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
Reconsidering the Selection Concept of Genetic Algorithms.. - Affenzeller, Wagner (Correct)
No context found.
G. Reinelt. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 3:376--384, 1991.
Minimizing The Stabbing Number Of Matchings, Trees, And.. - Fekete, LÜbbecke, Meijer (2003) (Correct)
No context found.
G. Reinelt. TSPLIB -- A traveling salesman problem library. ORSA J. Comput., 3(4):376--384, 1991.
New Generic Hybrids Based Upon Genetic Algorithms - Affenzeller (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling.. - Walshaw (2001) (Correct)
No context found.
G. Reinelt. TSPLIB--- A Traveling Salesman Problem Library. ORSA J. Comput., 3(4):376--384, 1991.
A New Approach to Evolutionary Computation: Segregative Genetic .. - Affenzeller (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ftp://ftp.zib.de/pub/Packages/mp-testdata/tsp/tsplib/index.html (1997)
A New Approach to Evolutionary Computation: Segregative Genetic .. - Affenzeller (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
No context found.
G. Reinelt. TSPLIB -- A traveling salesman problem library. ORSA Journal on Computing, 3:376--384, 1991.
Generic Heuristics for Combinatorial Optimization Problems - Affenzeller, Mayrhofer (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
Minimizing the Stabbing Number of Matchings, Trees, and.. - Fekete, Lübbecke, Meijer (Correct)
No context found.
G. Reinelt. TSPLIB -- A traveling salesman problem library. ORSA J. Comput., 3(4):376--384, 1991.
A Fast Swap-based Local Search Procedure for Location Problems - Resende, Werneck (2003) (Correct)
No context found.
G. Reinelt. TSPLIB: A traveling salesman problem library. ORSA Journal on Computing, 3:376--384, 1991. http://www.iwr.uni-heidelberg.de/groups/comopt/- software/TSPLIB95/.
A Multilevel Approach to the Travelling Salesman Problem - Walshaw (2000) (1 citation) (Correct)
No context found.
G. Reinelt. TSPLIB--- A Traveling Salesman Problem Library. ORSA J. Comput., 3(4):376--384, 1991.
Postponing Branching Decisions - van Hoeve, Milano (2004) (Correct)
No context found.
G. Reinelt, `TSPLIB - a Traveling Salesman Problem Library', ORSA Journal on Computing, 3, 376--384, (1991).
New Variants of Genetic Algorithms Applied to Problems of.. - Affenzeller (Correct)
No context found.
G. Reinelt. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 3:376--384, 1991.
A Self-Adaptive Model for Selective Pressure Handling.. - Affenzeller, Wagner (Correct)
No context found.
Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3 (1991) 376-384
Postponing Branching Decisions - van Hoeve, Milano (2004) (Correct)
No context found.
G. Reinelt, `TSPLIB - a Traveling Salesman Problem Library', ORSA Journal on Computing, 3, 376--384, (1991).
Segregative Genetic Algorithms (SEGA): A Hybrid Superstructure.. - Affenzeller (Correct)
No context found.
G. Reinelt. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 3:376--384, 1991.
First 50 documents Next 50
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