AI-OR Workshop
The
First International Joint Workshop on Artificial Intelligence and
Operations Reasearch was held on June 6-10, 1995 at Timberline Lodge,
Timberline, Oregon, U.S.A.
This page is provided to allow participants to directly access the
papers accepted for the workshop, and other related papers and
experimental data.
Accepted Papers
- Philippe Baptiste, Claude Le Pape and Wim Nuijten:
- Incorporating efficient OR
algorithms in constraint-based scheduling
- James C. Bean, Atidel Hadj-Alouane and Bryan Norman:
- Robust encodings of OR problems for
genetic algorithms
- Brian Borchers and John E.Mitchell
- An approach to the maximum
satisfiability problem that combines heuristics with branch and
cut
- E. Andrew Boyd:
- Integer programming for job shop
scheduling and a related problem
- Cheng-Chung Cheng and Stephen F. Smith:
- A constraint satisfaction
approach to makespan scheduling
- Collette Coullard and Robert Fourer:
- Interdependence of methods and
representations in design of software for combinatorial
optimization
- Thomas Dean:
- Position paper
- Ian P. Gent and Toby Walsh:
- The TSP phase transition
- Yuejun Jiang, Henry Kautz and Bart Selman:
- Solving problems with hard and
soft constraints using a stochastic algorithm for max-sat
- Helena R. Lourenco and Michiel Zwijnenburg:
- Combining the large-step
optimization with tabu-search: Applications to the job-shop
scheduling problem
- Steve Minton, John A. Allen, Shawn Wolfe and Andrew Philpot:
- An overview of learning in the
Multi-tac system
- John S. Schlipf, Fred S. Annexstein, John V. Franco and R.P.
Swaminathan:
- On finding solutions for
extended Horn formulas
- Barbara M. Smith, Sally C. Brailsford, Peter M. Hubbarnd and H.
Paul Williams:
- The progressive party
problem: Linear programming and constraint programming compared
Other information
There is a collection of experimental data
available. Participants are encouraged to use this data for evaluation of
their methods and/or provide additional data.
Various participants have made available links to their
related work, either in the form of papers
or statements about their research.
For comments and corrections, please e-mail webmaster@cirl.uoregon.edu.