Volume 184, Issue 1

Search all Annals of Operations Research articles

April 2011

Issue Editors:

Laurent Perron,
Michael A. Trick

14 articles in this issue

Foreword
Laurent Perron
Michael Trick
OriginalPaper 05 January 2011 Pages: 1 - 1
Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
Douglas S. Altner
Özlem Ergun
OriginalPaper 23 March 2010 Pages: 3 - 26
New filtering for the cumulative constraint in the context of non-overlapping rectangles
Nicolas Beldiceanu
Mats Carlsson
Emmanuel Poder
OriginalPaper 19 March 2010 Pages: 27 - 50
Optimal resource allocation and scheduling for the CELL BE platform
Luca Benini
Michele Lombardi
Martino Ruggiero
OriginalPaper 25 February 2010 Pages: 51 - 77
Domino portrait generation: a fast and scalable approach
Hadrien Cambazard
John Horan
Barry O’Sullivan
OriginalPaper 05 June 2010 Pages: 79 - 95
A branch-and-bound algorithm for hard multiple knapsack problems
Alex S. Fukunaga
OriginalPaper 05 November 2009 Pages: 97 - 119
Using local search to speed up filtering algorithms for some NP-hard constraints
Philippe Galinier
Alain Hertz
Gilles Pesant
OriginalPaper 19 February 2010 Pages: 121 - 135
Haplotype inference with pseudo-Boolean optimization
Ana Graça
João Marques-Silva
Arlindo L. Oliveira
OriginalPaper 09 December 2009 Pages: 137 - 162
A hybrid constraint programming approach to the log-truck scheduling problem
Nizar El Hachemi
Michel Gendreau
Louis-Martin Rousseau
OriginalPaper 09 February 2010 Pages: 163 - 178
The weighted Grammar constraint
George Katsirelos
Nina Narodytska
Toby Walsh
OriginalPaper 05 February 2010 Pages: 179 - 207
Leveraging belief propagation, backtrack search, and statistics for model counting
Lukas Kroc
Ashish Sabharwal
Bart Selman
OriginalPaper 14 January 2010 Pages: 209 - 231
An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
Luc Mercier
Pascal Van Hentenryck
OriginalPaper 02 November 2010 Pages: 233 - 271
Optimal deployment of eventually-serializable data services
L. Michel
A. Shvartsman
P. Van Hentenryck
OriginalPaper 05 February 2010 Pages: 273 - 294
Global propagation of side constraints for solving over-constrained problems
Thierry Petit
Emmanuel Poder
OriginalPaper 30 January 2010 Pages: 295 - 314

Volume 184, Issue 1

Foreword

Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems

New filtering for the cumulative constraint in the context of non-overlapping rectangles

Optimal resource allocation and scheduling for the CELL BE platform

Domino portrait generation: a fast and scalable approach

A branch-and-bound algorithm for hard multiple knapsack problems

Using local search to speed up filtering algorithms for some NP-hard constraints

Haplotype inference with pseudo-Boolean optimization

A hybrid constraint programming approach to the log-truck scheduling problem

The weighted Grammar constraint

Leveraging belief propagation, backtrack search, and statistics for model counting

An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization

Optimal deployment of eventually-serializable data services

Global propagation of side constraints for solving over-constrained problems

Navigation