Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
Selection of search strategies for solving 3-sat problems
Some remarks on quadratic programming with 0-1 variables
Strategies for LP-based solving a general class of scheduling problems.
In this work we describe some strategies that have been proved to be very efficient for solving the following type of scheduling problems: Assume a set of jobs is to be performed along a planning horizon by selecting one from several alternatives for doing so. Besides selecting the alternative for each job, the target consists of choosing the periods at which each component of the work will be done, such that a set of scheduling and technological constraints is satisfied. The problem is formulated...