Cliques, Coloring, and Satisfiability

Keyphrases

Publications

volume 26, 1996

Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993 Cliques, Coloring, and Satisfiability 26 (1996)

1993

Michael A. Trick
Appendix: Second DIMACS Challenge test problems. Cliques, Coloring, and Satisfiability (1993)
Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan
Approximately solving Maximum Clique using neural network and related heuristics. Cliques, Coloring, and Satisfiability (1993)
Mark Brockington, Joseph C. Culberson
Camouflaging independent sets in quasi-random graphs. Cliques, Coloring, and Satisfiability (1993)
William M. Spears
Simulated annealing for hard satisfiability problems. Cliques, Coloring, and Satisfiability (1993)
Brigitte Jaumard, Mihnea Stan, Jacques Desrosiers
Tabu search and a quadratic relaxation for the Satisfiability problem. Cliques, Coloring, and Satisfiability (1993)
Craig A. Morgenstern
Distributed coloration neighborhood search. Cliques, Coloring, and Satisfiability (1993)
Joseph C. Culberson, Feng Luo
Exploring the k-colorable landscape with Iterated Greedy. Cliques, Coloring, and Satisfiability (1993)
Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos
A continuous based heuristic for the maximum clique problem. Cliques, Coloring, and Satisfiability (1993)
Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang
A linear programming and rounding approach to max 2-sat. Cliques, Coloring, and Satisfiability (1993)
Tal Grossman
Applying the INN model to the Maximum Clique problem. Cliques, Coloring, and Satisfiability (1993)
Egon Balas, William Niehaus
Finding large cliques in arbitrary graphs by bipartite matching. Cliques, Coloring, and Satisfiability (1993)
Allen Van Gelder, Yumi K. Tsuji
Satisfiability testing with more reasoning and less guessing. Cliques, Coloring, and Satisfiability (1993)
Steven E. Hampson, Dennis F. Kibler
Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again. Cliques, Coloring, and Satisfiability (1993)
Daniele Pretolani
Efficiency and stability of hypergraph SAT algorithms. Cliques, Coloring, and Satisfiability (1993)
Edward C. Sewell
An improved algorithm for exact graph coloring. Cliques, Coloring, and Satisfiability (1993)
Mauricio G. C. Resende, Thomas A. Feo
A GRASP for satisfiability. Cliques, Coloring, and Satisfiability (1993)
Mark K. Goldberg, Reid D. Rivenburgh
Constructing cliques using restricted backtracking. Cliques, Coloring, and Satisfiability (1993)
Patrick Soriano, Michel Gendreau
Tabu search algorithms for the maximum clique problem. Cliques, Coloring, and Satisfiability (1993)
Carlo Mannino, Antonio Sassano
Edge projection and the maximum cardinality stable set problem. Cliques, Coloring, and Satisfiability (1993)
Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure
An exact quadratic 0-1 algorithm for the stable set problem. Cliques, Coloring, and Satisfiability (1993)
Bart Selman, Henry A. Kautz, Bram Cohen
Local search strategies for satisfiability testing. Cliques, Coloring, and Satisfiability (1993)
Steven Homer, Marcus Peinado
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. Cliques, Coloring, and Satisfiability (1993)
Fred W. Glover, Mark Parker, Jennifer Ryan
Coloring by tabu branch and bound. Cliques, Coloring, and Satisfiability (1993)
Charles Fleurent, Jacques A. Ferland
Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability. Cliques, Coloring, and Satisfiability (1993)
Yuichi Asahiro, Kazuo Iwama, Eiji Miyano
Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability (1993)
Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier
SAT versus UNSAT. Cliques, Coloring, and Satisfiability (1993)
David S. Johnson, Michael A. Trick
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. Cliques, Coloring, and Satisfiability (1993)
Gary Lewandowski, Anne Condon
Experiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, Coloring, and Satisfiability (1993)
Richard J. Wallace, Eugene C. Freuder
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiabilitv problems. Cliques, Coloring, and Satisfiability (1993)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability (1993)