Sciweavers

20 search results - page 4 / 4
» cpaior 2007
Sort
View
CPAIOR
2007
Springer
13 years 11 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
CPAIOR
2007
Springer
13 years 11 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
CPAIOR
2007
Springer
13 years 11 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
CPAIOR
2007
Springer
13 years 11 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
CPAIOR
2007
Springer
13 years 11 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker