57 search results - page 2 / 12 » Pebbling and Branching Programs Solving the Tree Evaluation ... |
ANOR
2008
13 years 5 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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
MP
2006
13 years 4 months ago
2006
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...