| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A branch-and-bound algorithm for hard multiple knapsack problems
|
Fukunaga, Alex S.
|
|
2009
|
184 |
1 |
p. 97-119
|
article
|
| 2 |
A hybrid constraint programming approach to the log-truck scheduling problem
|
El Hachemi, Nizar
|
|
2010
|
184 |
1 |
p. 163-178
|
article
|
| 3 |
An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
|
Mercier, Luc
|
|
2010
|
184 |
1 |
p. 233-271
|
article
|
| 4 |
Domino portrait generation: a fast and scalable approach
|
Cambazard, Hadrien
|
|
2010
|
184 |
1 |
p. 79-95
|
article
|
| 5 |
Foreword
|
Perron, Laurent
|
|
2011
|
184 |
1 |
p. 1
|
article
|
| 6 |
Global propagation of side constraints for solving over-constrained problems
|
Petit, Thierry
|
|
2010
|
184 |
1 |
p. 295-314
|
article
|
| 7 |
Haplotype inference with pseudo-Boolean optimization
|
Graça, Ana
|
|
2009
|
184 |
1 |
p. 137-162
|
article
|
| 8 |
Leveraging belief propagation, backtrack search, and statistics for model counting
|
Kroc, Lukas
|
|
2010
|
184 |
1 |
p. 209-231
|
article
|
| 9 |
New filtering for the cumulative constraint in the context of non-overlapping rectangles
|
Beldiceanu, Nicolas
|
|
2010
|
184 |
1 |
p. 27-50
|
article
|
| 10 |
Optimal deployment of eventually-serializable data services
|
Michel, L.
|
|
2010
|
184 |
1 |
p. 273-294
|
article
|
| 11 |
Optimal resource allocation and scheduling for the CELL BE platform
|
Benini, Luca
|
|
2010
|
184 |
1 |
p. 51-77
|
article
|
| 12 |
Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
|
Altner, Douglas S.
|
|
2010
|
184 |
1 |
p. 3-26
|
article
|
| 13 |
The weighted Grammar constraint
|
Katsirelos, George
|
|
2010
|
184 |
1 |
p. 179-207
|
article
|
| 14 |
Using local search to speed up filtering algorithms for some NP-hard constraints
|
Galinier, Philippe
|
|
2010
|
184 |
1 |
p. 121-135
|
article
|
Journal description