October 12-16, 1999
Alexandria, Virginia, USA

xywang@gmu.edu

1. Operational Equivalence of CHR Programs And Constraints by Slim Abdennadher and Thom Fruehwirth
2. Excluding Symmetries in Constraint Based Search by Rolf Backofen and Sebastian Will
3. Applying Constraint Programming to Protein Structure Determination by Ludwig Krippahl and Pedro Barahona
4. On Forward Checking for Non-binary Constraint Satisfaction by Christian Bessiere, Pedro Meseguer, Eugene C. Freuder and Javier Larrosa
5. Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP by Marcus Bjareland and Peter Jonsson
6. Closure Functions and Width 1 Problems by Victor Dalmau and Justin Pearson
7. Cost-based Domain Filtering by Filippo Focacci, Andrea Lodi and Michela Milano
8. A Meta-Heuristic Factory for Vehicle Routing Problems by Yves Caseau, François Laburthe, Glenn Silverstein
9. Resource allocation in networks using constraint satisfaction by Christian Frei and Boi Faltings
10. Optimal Distributed Arc-Consistency by Youssef Hamadi
11. Multistep Filtering Operators for Ordinary Differential Equations by Micha Janssen, Yves Deville, and Pascal Van Hentenryck
12. The Goldilocks Problem by Tudor Hulubei and Eugene C. Freuder
13. Towards a complete classification of tractability in point algebras for nonlinear time by Mathias Broxvall and Peter Jonsson
14. Improving a Heuristic Repair Method for Large School Timetabling Problems by Kazuya Kaneko, Masazumi Yoshikawa, and Yoichiro Nakakuki
15. A Framework for Constraint Programming Based Column Generation by Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle and Meinolf Sellmann
16. Partition-Based Lower Bound for Max-CSP by Javier Larrosa and Pedro Meseguer
17. Steps Towards CLP(Diagram) by Bernd Meyer
18. Automatic generation of constraint propagation algorithms for small finite domains by Krzysztof R. Apt and Eric Monfroy
19. Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search by Nicolas Prcovic and Bertrand Neveu
20. Automatic Generation of Music Programs by Francois Pachet and Pierre ROY
21. Search Procedures and Parallelism in Constraint Programming by Laurent Perron
22. Enforcing arc consistency by solving subCSPs on the fly by Christian Bessiere and Jean-Charles Regin
23. Arc Consistency for Global Cardinality Constraints with costs by Jean-Charles Regin
24. The Brelaz Heuristic and Optimal Static Orderings by Barbara M Smith
25. A Fixpoint Definition of Dynamic Constraint Satisfaction by Timo Soininen, Esther Gelle and Ilkka Niemelä
26. On the Behavior and Application of Constraint Weighting by John thornton and Abdul Sattar
27. Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization by Benjamin W. Wah and Tao Wang
28. Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation by Takayuki Suyama, Makoto Yokoo, and Akira Nagoya
29. Tight Cooperation for Combinatorial Optimization:An Application to Piecewise Linear Optimization by Philippe Refalo
30. An Overview of HAL by Bart Demoen, Maria Garcia de la Banda, Warwick Harvey, Kim Marriott and Peter Stuckey