Christine Wei Wu

Learn More
We discuss the problem of using constraint models to force generated graphs to be connected. We represent the graph as a simple adjacency matrix, and then attempt to post constraints ensuring connectiv-ity. Doing this using standard modelling primitives is harder than expected, because of a problem with our use of the implication operator. We develop a(More)
Many real-world scheduling problems are subject to change, and scheduling solutions should be robust to those changes. We consider a single-machine scheduling problem where the processing time of each activity is characterized by a normally-distributed random variable, and we attempt to minimize flowtime. We develop an initial constraint model for(More)
Many difficult combinatorial problems have been modelled as standard CSPs and solved by classic constraint programming techniques. However, in practice, many problems are dynamic, uncertain and changing, while the decisions have to be made before the full problem is known. For example, in the Dynamic Vehicle Routing Problem (DVRP) [1], new customer orders(More)
  • 1