67 search results - page 4 / 14 » Linear Invariant Generation Using Non-linear Constraint Solv... |
CPAIOR
2007
Springer
14 years 1 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...
AIPS
2008
13 years 9 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
SP
2006
IEEE
14 years 1 months ago
2006
IEEE
Many current systems allow data produced by potentially malicious sources to be mounted as a file system. File system code must check this data for dangerous values or invariant ...
CCO
2001
Springer
13 years 12 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
CSCLP
2004
Springer
14 years 24 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...