Mark Bartlett - Constraint Programming

The Temporal Knapsack Problem

This project defined and investigated a problem called the temporal knapsack problem and compared several algorithms for solving it. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a multiprocessor to bids for the resources. The algorithms considered used and combined techniques from constraint programming, artificial intelligence and operations research.

Adapted from "The Temporal Knapsack Problem and its Solution"

Complete List of My Publications on Constraint Programming

The Temporal Knapsack Problem and its Solution
Mark Bartlett, Alan Frisch, Youssef Hamadi, Ian Miguel and Chris Unsworth
Proc. of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), pp34–48, Lecture Notes in Computer Science 3524, 2005
See also various Environmental Economics publications, which are based on Constraint Satisfaction