Friday, March 2, 2007
Accepted Papers at CP’AI’OR’07
Constrained Clustering via Concavity Cuts.
Yu Xia.
Solving a Stochastic Queueing Control Problem with Constraint Programming.
Daria Terekhov and Chris Beck.
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.
Tamas Kis and András Kéri.
Eliminating redundant clauses in SAT instances.
Fourdrinoy olivier, Eric Gregoire, Bertrand Mazure and Sais Lakhdar.
A Global Constraint for Total Weighted Completion Time.
Andras Kovacs and Chris Beck.
A continuous Multi-Resources cumulative Constraint with Positive-Negative Resource Consumption-Production.
Emmanuel Poder and Beldiceanu Nicolas.
Solving the Discrete Time/Resource Trade-off Problem in Project Scheduling with Genetic Algorithm.
Mohammad Ranjbar and Fereydoon Kianfar.
Best-First AND/OR Search for Solving 0/1 Integer Linear Programming Problems.
Radu Marinescu and Rina Dechter.
The ``Not-Too-Heavy Spanning Tree'' Constraint.
Gregoire Dooms and Irit Katriel.
The Deviation Constraint.
Pierre Schaus, Yves Deville, Pierre Dupont and Jean-Charles Regin.
A Constraint Programming Approach to the Hospitals / Residents Problem.
David Manlove, Gregg O'Malley, Patrick Prosser and Chris Unsworth.
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
Marjan van den Akker, Guido Diepen and Han Hoogeveen.
Directional Interchangeability for Enhancing CSP Solving.
wady naanaa.
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.
Meinolf Sellmann, Luc Mercier and Daniel H. Leventhal.
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost.
Roberto Rossi, S. Armagan Tarim, Brahim Hnich and Steven Prestwich.
A Position-Based Propagator for the Open-Shop Problem.
Jean-Noël Monette, Yves Deville and Pierre Dupont.
Tradeoffs in Typical Hardness of Feasibility versus Optimality.
Jon Conrad, Carla Gomes, Willem-Jan van Hoeve, Ashish Sabharwal and Jordan Suter.
New Constraint Programming and Integer Programming Approaches to Minimum Cardinality Decomposition of Integer Matrices with the Consecutive-Ones Property.
Davaatseren Baatar, Natashia Boland, Sebastian Brand and Peter J. Stuckey.
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint.
Jan-Georg Smaus.
Hybrid Local Search for Constrained Financial Portfolio Selection Problems.
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli and Andrea Schaerf.
Modeling the Regular Constraint with Integer Programming.
Marie-Claude Côté, Bernard Gendron and Louis-Martin Rousseau.
Necessary Condition for Path Partitioning Constraints.
Lorca Xavier and Beldiceanu Nicolas.
Generalizations of the Global Cardinality Constraint for Hierarchical Resources.
Alessandro Zanarini and Gilles Pesant.
A Learning Minimal Discrepancy Search for CSPs.
Wafa Karoui, Marie-José Huguet, Pierre Lopez and Wady Naanaa.
Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem.
Hakan Yildiz and Michael Trick.
A Large Neighborhood Search Heuristic for Graph Coloring.
Hakan Yildiz and Michael Trick.
Preprocessing expression-based constraint satisfaction problems for stochastic local search.
Sivan Sabato and Yehuda Naveh.
Cost-Bounded Binary Decision Diagrams for 0-1 Programming.
Tarik Hadzic and John Hooker.
