Abstract is missing.
- Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiabilityDavid S. Johnson, Michael A. Trick. 1-10
- Polyhedral methods for the maximum clique problem EGON BALAS, SABASTIAN CERIA, GERARD CORNUEJOLS, ANDGábor Pataki. 11-28
- Finding large cliques in arbitrary graphs by bipartite matchingEgon Balas, William Niehaus. 29-52
- An exact quadratic 0-1 algorithm for the stable set problem JEAN-MARIE BOURJOLLY, PAUL GILL, GILBERT LAPORTE, ANDHélène Mercure. 53-74
- Camouflaging independent sets in quasi-random graphsMark Brockington, Joseph C. Culberson. 75-88
- Constructing cliques using restricted backtrackingMark K. Goldberg, Reid D. Rivenburgh. 89-102
- A continuous based hueristic for the maximum clique problemLuana E. Gibbons, Donald W. Hearn, Panos M. Pardalos. 103-124
- Applying the INN model to the Maximum Clique problemTal Grossman. 125-146
- Experiments with polynomial-time CLIQUE approximation algorithms on very large graphsSteven Homer, Marcus Peinado. 147-168
- Approximately solving Maximum Clique using neural network and related heuristicsArun Jagota, Laura A. Sanchis, Ravikanth Ganesan. 169-204
- Edge projection and the maximum cardinality stable set problemCarlo Mannino, Antonio Sassano. 205-220
- Tabu search algorithms for the maximum clique problemPatrick Soriano, Michel Gendreau. 221-244
- Exploring the k-coloable landscape with Iterated GreedyJoseph C. Culberson, Feng Luo. 245-284
- Coloring by tabu branch and boundFred Glover, Mark Parker, Jennifer Ryan. 285-308
- Experiments with parallel graph coloring heuristics and applications of graph coloringGary Lewandowski, Anne Condon. 309-334
- Distributed coloration neighborhood searchCraig A. Morgenstern. 335-358
- A. improved algorithm for exact graph coloringEdward C. Sewell. 359-376
- Random generation of test instances ith controlled attributesYuichi Asahiro, Kazuo Iwama, Eiji Miyano. 377-394
- A linear programming and rounding approach to max 2-satJoseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang. 395-414
- SAT versus UNSATOlivier Dubois 0002, Pascal André, Yacine Boufkhad, Jacques Carlier. 415-436
- Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start againSteven E. Hampson, Dennis F. Kibler. 437-456
- Tabu search and a quadratic relaxation for the Satisfiability problemBrigitte Jaumard, Mihnea Stan, Jacques Desrosiers. 457-478
- Efficiency, and stability of hypergraph SAT algorithmsDaniele Pretolani. 479-498
- A GRASP for satisfiabilityMauricio G. C. Resende, Thomas A. Feo. 499-520
- Local search strategies for satisfiability testingBart Selman, Henry A. Kautz, Bram Cohen. 521-532
- Simulated annealing for hard satisfiability problemsWilliam M. Spears. 533-558
- Satisfiability testing with more reasoning and less guessingAllen Van Gelder, Yumi K. Tsuji. 559-586
- Comparative studies of constraint satisfaction and Davis-Putnam, algorithms for maximum satisfiabilitv problemsRichard J. Wallace, Eugene C. Freuder. 587-618
- Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and SatisfiabilityCharles Fleurent, Jacques A. Ferland. 619-652
- Appendix: Second DIMACS Challenge test problemsMichael A. Trick. 653