default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 184
Volume 184, Number 1, April 2011
- Laurent Perron, Michael A. Trick
:
Foreword. 1 - Douglas S. Altner, Özlem Ergun:
Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems. 3-26 - Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, Emmanuel Poder:
New filtering for the cumulative constraint in the context of non-overlapping rectangles. 27-50 - Luca Benini, Michele Lombardi, Michela Milano, Martino Ruggiero:
Optimal resource allocation and scheduling for the CELL BE platform. 51-77 - Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan:
Domino portrait generation: a fast and scalable approach. 79-95 - Alex S. Fukunaga:
A branch-and-bound algorithm for hard multiple knapsack problems. 97-119 - Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using local search to speed up filtering algorithms for some NP-hard constraints. 121-135 - Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira:
Haplotype inference with pseudo-Boolean optimization. 137-162 - Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau:
A hybrid constraint programming approach to the log-truck scheduling problem. 163-178 - George Katsirelos, Nina Narodytska, Toby Walsh:
The weighted Grammar constraint. 179-207 - Lukas Kroc, Ashish Sabharwal, Bart Selman:
Leveraging belief propagation, backtrack search, and statistics for model counting. 209-231 - Luc Mercier, Pascal Van Hentenryck:
An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization. 233-271 - Laurent D. Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck:
Optimal deployment of eventually-serializable data services. 273-294 - Thierry Petit, Emmanuel Poder:
Global propagation of side constraints for solving over-constrained problems. 295-314
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-05 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
