Combinatorial Problems -- A Subject Catalog
Created: 7/25/95, Modified: 9/19/96.
[Artificial Intelligence page],
[Operations Research page],
[Kanada's home page in English],
[Kanada's home page in Japanese].
- DIMACS is an abbreviation of Center for Discrete Mathematics
and Theoretical Computer Science.
- ``DIMACS is a national research center, funded by the National
Science Foundation. It is a joint project, whose direct participants
are Rutgers University, Princeton University, AT&T Bell Labs, and
See DIMACS and GSAT/WSAT sections.
-- A Collection of Traveling Salesman Problem instances.
- From Evolutionary
-- Collection of Mixed Integer Programming instances.
at Imperial College Management School, including
Location, Scheduling, Steiner, 2D Cutting, Vehicle Routing Problems, etc.
(but not accessible!)
Graph coloring -- Bibliographies
the Really Hard Problems Are by P. Cheeseman, B. Kanefsky,
and W. M. Taylor (in HTML), containing Hamilton Circuits, Graph Coloring,
K-Satisfiability and Travelling Salesman Problems
Transitions in Search
Constraint Satisfaction Problems: Hard and Easy Problems
Thomas Schiex, Helene Fargier, and Gerard Verfaillie
Algorithms' Home Page
- Comparisons of GA, SA and Tabu Search:
Search with Memory: Benchmarking RTS (Reactive Tabu Search method),
by R. Battiti and G Tecchiolli
Constraint Satisfaction: Application to Radiosurgery by
R. B. Altman and R. Tombropoulos, Knowledge Systems
Laboratory, Medical Computer Science, KSL-94-35, November 1994.
Empirical Evaluation of a Randomized Algorithm for Probabilistic
Inference, by M. R. Chavez and G. F. Cooper,
In M. Henrion et al., Ed., Fifth Workshop on Uncertainty in Artificial
Elsevier Science Publishers B.V., North-Holland, 1989.
(Postscript not available)
- See Programming Page
for theories of graph and other problems.
- See Operations Research Page
for other optimization problems.
- See Artificial Intelligence Page
for other AI-related topics.
- A Search Result on
Probabilistic/Randomized Algorithm (Computation) by
Y. Kanada (Send comments
to kanada @ trc.rwcp.or.jp)