1102 search results - page 24 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
INFORMS
1998
13 years 8 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
JAR
2000
13 years 9 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
HICSS
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
IJCAI
1997
13 years 10 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
ICTAI
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...