#### Filter Results:

- Full text PDF available (82)

#### Publication Year

1994

2017

- This year (6)
- Last 5 years (31)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Barry McCollum, Andrea Schaerf, +6 authors Edmund K. Burke
- INFORMS Journal on Computing
- 2010

The 2nd International Timetabling Competition (ITC2007) was announced on the 1st August 2007. Building on the success of the first, this competition aimed to further develop interest in the area of educational timetabling while providing researchers with models of the problems faced which incorporate an increased number of real world constraints. A main… (More)

- Andrew J. Parkes
- AAAI/IAAI
- 1997

Many problem ensembles exhibit a phase transition that is associated with a large peak in the average cost of solving the problem instances. However, this peak is not necessarily due to a lack of solutions: indeed the average number of solutions is typically exponentially large. Here, we study this situation within the context of the satissability… (More)

- Andrew J. Parkes
- CP
- 2002

- Gabriela Ochoa, Matthew R. Hyde, +8 authors Edmund K. Burke
- EvoCOP
- 2012

Automating the design of heuristic search methods is an active research field within computer science, artificial intelligence and operational research. In order to make these methods more generally applicable, it is important to eliminate or reduce the role of the human expert in the process of designing an effective methodology to solve a given… (More)

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- Computers & OR
- 2010

In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a… (More)

- Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy
- AAAI/IAAI
- 1998

When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large effect on the viability of the solution. The AI community has responded to this difficulty by investigating the development of " robust problem solvers " that are intended to be… (More)

- Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
- Annals OR
- 2012

This paper describes a branch-and-cut procedure for an extension of the bounded colouring problem, generally known as curriculum-based university course timetabling. In particular, we focus on Udine Course Timetabling [di Gaspero and Schaerf, J. Math. Model. Algorithms 5:1], which has been used in Track 3 of the 2007 International Timetabling Competition.… (More)

- Barry McCollum, Paul McMullan, Andrew J. Parkes, Edmund K. Burke, Rong Qu
- Annals OR
- 2012

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable… (More)

- Andrew J. Parkes
- 2001

We consider a simple parallelization, Wsat(par), of Wsat in which many flips can be selected and performed in parallel, and independently, using a linear number of processors. On random 3-SAT even mildly underconstrained problems can be solved by sequential Wsat in O(n) time (where n is the number of variables per instance). Empirically, we find that in… (More)

- Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes
- Inf. Sci.
- 2016

Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem. An important variant of the problem requires scheduling of activities for multiple projects considering availability of local and global resources while respecting a range of constraints. This problem has been addressed by a… (More)