| Alternate document: Details Experimental Analyses of the Life Span Method for the Quadratic Assignment Problem (95) Katsuki Fujisawa, Mikio Kubo |
Katsuki Fujisawa, Mikio Kubo  Home/Search
Context Related
| ismj.archi.kyotou.ac.jp/...mssp.ps.gz is.titech.ac.jp/labs/kojim...mssp.ps.gz 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: ismj.archi.kyotou.ac...research (more) From: is.titech.ac.jp/labs/k...research (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An efficient algorithm for the approximate solution of the maximum cardinality stable set problem is presented. The algorithm is based on a variant of tabu search which we call the life span method. Numerical experiments on random and benchmark instances show that our algorithm dominates all the algorithms given in the literature both in accuracy of solutions and in speed. We also investigate how to tune up our implementation and to optimize the parameters via extensive numerical experiments.... (Update)
Context of citations to this paper: More
...the vertex cover problem and the maximum stable set problem are equivalent. In this section, we describe the LSM for solving the MSSP [14]. Note that we can easily construct an algorithm for the maximum clique problem, the minimum cover problem, and a weighted version of...
Cited by: More
The Life Span Method - A New Variant of Local Search - - Kubo, Fujisawa (1997) (Correct)
Similar documents (at the sentence level):
14.6%: Experimental Analyses of the Life Span Method for the.. - Fujisawa, Kubo (1995) (Correct)
Active bibliography (related documents): More All
1.6: The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999) (Correct)
0.4: On Very Large Maximum Clique Problems (Extended Abstract) - Abello, al. (1998) (Correct)
0.4: Constructing Cliques Using Restricted Backtracking - Goldberg, Rivenburgh (1996) (Correct)
Similar documents based on text: More All
1.1: The maximal stable set problem: Copositive programming and.. - Krishnan (2001) (Correct)
0.6: A Combinatorial Algorithm for Computing a Maximum.. - Eisenbrand, Funke.. (2002) (Correct)
0.5: A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
Related documents from co-citation: More All
2: Optimization by simulated annealing: An experimental evaluation (context) - Johnson, Aragon et al. - 1990
BibTeX entry: (Update)
K. Fujisawa, S. Morito, and M. Kubo. Experimental analyses of the life span method for the maximum stable set problem. The Institute of Statistical Mathematics Cooperative Research Report, 75:135--165, 1995. http://citeseer.ist.psu.edu/fujisawa95experimental.html More
@misc{ fujisawa95experimental,
author = "K. Fujisawa and S. Morito and M. Kubo",
title = "Experimental analyses of the life span method for the maximum stable set
problem",
text = "K. Fujisawa, S. Morito, and M. Kubo. Experimental analyses of the life
span method for the maximum stable set problem. The Institute of Statistical
Mathematics Cooperative Research Report, 75:135--165, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/fujisawa95experimental.html" }
Citations (may not include all citations):2138 Genetic Algorithms in Search (context) - Goldberg - 1989
686 A guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
548 Genetic Algorithm + Data Structure = Evolution Programs (context) - Michalewicz - 1992
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
411 Random Graphs (context) - Bollob'as - 1985
371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1989
371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1991
228 Simulated Annealing and Boltzmann Machines (context) - Aarts, Korst - 1989
76 ORSA Journal on Computing (context) - Glover - 1989
76 Kluwer Academic Publishers (context) - van Laarhoven, Aarts et al. - 1987
63 Algorithms for the maximum satisfiability problem (context) - Hansen, Jaumard - 1990
63 the complexity of approximating the independent set problem (context) - Berman, Schnitger - 1989
62 The maximum clique problem (context) - Pardalos, Xue - 1993
40 A Greedy Randomized Adaptive Search Procedure for Maximum In.. (context) - Feo, Resende et al. - 1994
39 Graphical Evolution (context) - Palmer - 1985
38 Finding a Maximum Clique in an Arbitrary Graph (context) - Balas, Yu - 1986
33 Probabilistic checking of proofs; a new characterization of .. (context) - Arora, Safra - 1992
30 Object-Oriented implementation of heuristic search methods f.. (context) - Fleurent, Ferland - 1994
24 The steepest ascent mildest descent heuristic for combinator.. (context) - Hansen - 1986
18 Simulated annealing: an annotated bibliography (context) - Collins, Eglese et al. - 1988
16 Stabulus: a technique for finding stable sets in large graph.. (context) - Friden, Hertz et al. - 1989
16 The Largest Clique Size in a Random Graph (context) - Matula - 1976
12 Solving the maximum clique problem using a tabu search appro.. (context) - Gendreau, Soriano et al. - 1993
10 Optimization by neural networks (context) - Ramanujam, Sadayappanv - 1988
8 A chapter in Modern Heuristic Techniques for Combinatorial P.. (context) - Glover - 1992
8 Mathematical Proceedings of the Cambridge Philosophical Soci.. (context) - Bollob'as, Erdos et al. - 1976
6 the intractability of approximation problems (context) - Arora, Lund et al. - 1992
6 Algebraic tiling (context) - Stein - 1974
6 An interior point approach to the maximum independent set pr.. - Karmarkar, Ramakrishnan et al. - 1989
4 A Combinatorial Approach for Keller's Conjecture (context) - Corradi, Szabo - 1990
4 An exact algorithm based on tabu search for finding a maximu.. (context) - Friden, Hertz et al. - 1990
4 Approximating the maximum clique is almost NP -complete (context) - Feige, Goldwasser et al. - 1991
4 Tabu search II (context) - Glover - 1989
3 A computational study of the weighted independent set proble.. (context) - Kopf, Ruhe - 1987
2 The Life Span Method -- A New Variant of Local Search - Kubo - 1993
1 the Twentieth Annual ACM STOC (context) - Papadimitriou, Yannakakis et al. - 1988
Documents on the same site (http://is-mj.archi.kyoto-u.ac.jp/~fujisawa/research.html): More
Experimental Analyses of the Life Span Method for the.. - Fujisawa, Kubo (1995) (Correct)
The Life Span Method - A New Variant of Local Search - - Kubo, Fujisawa (1997) (Correct)
Exploiting Sparsity in Primal-Dual Interior-Point.. - Fujisawa, Kojima, Nakata (1997) (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