729 search results - page 35 / 146 » Solving subgraph isomorphism problems with constraint progra... |
149
Voted
ANOR
2008
15 years 3 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
127
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
131
Voted
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
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...
142
Voted
EUROCAST
1994
Springer
15 years 7 months ago
1994
Springer
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
125
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...