729 search results - page 35 / 146 » Solving subgraph isomorphism problems with constraint progra... |
181
click to vote
ANOR
2008
15 years 6 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...
155
click to vote
ECAI
2008
Springer
15 years 7 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...
168
click to vote
CPAIOR
2007
Springer
16 years 3 days 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...
174
click to vote
EUROCAST
1994
Springer
15 years 10 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...
149
click to vote
ICML
2008
IEEE
16 years 6 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 ...