A branch-and-bound algorithm for hard multiple knapsack problems.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 97, doi. 10.1007/s10479-009-0660-y
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 2011 AND VI 184 AND IP 1
Results: 14
1
2
Haplotype inference with pseudo-Boolean optimization.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 137, doi. 10.1007/s10479-009-0675-4
- By:
- Publication type:
- Article
3
Leveraging belief propagation, backtrack search, and statistics for model counting.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 209, doi. 10.1007/s10479-009-0680-7
- By:
- Publication type:
- Article
4
Global propagation of side constraints for solving over-constrained problems.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 295, doi. 10.1007/s10479-010-0683-4
- By:
- Publication type:
- Article
5
The weighted Grammar constraint.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 179, doi. 10.1007/s10479-010-0697-y
- By:
- Publication type:
- Article
6
Optimal deployment of eventually-serializable data services.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 273, doi. 10.1007/s10479-010-0684-3
- By:
- Publication type:
- Article
7
A hybrid constraint programming approach to the log-truck scheduling problem.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 163, doi. 10.1007/s10479-010-0698-x
- By:
- Publication type:
- Article
8
Using local search to speed up filtering algorithms for some NP-hard constraints.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 121, doi. 10.1007/s10479-010-0715-0
- By:
- Publication type:
- Article
9
Optimal resource allocation and scheduling for the CELL BE platform.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 51, doi. 10.1007/s10479-010-0718-x
- By:
- Publication type:
- Article
10
New filtering for the cumulative constraint in the context of non-overlapping rectangles.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 27, doi. 10.1007/s10479-010-0731-0
- By:
- Publication type:
- Article
11
Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 3, doi. 10.1007/s10479-010-0730-1
- By:
- Publication type:
- Article
12
Domino portrait generation: a fast and scalable approach.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 79, doi. 10.1007/s10479-010-0738-6
- By:
- Publication type:
- Article
13
An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 233, doi. 10.1007/s10479-010-0798-7
- By:
- Publication type:
- Article
14
Foreword.
- Published in:
- Annals of Operations Research, 2011, v. 184, n. 1, p. 1, doi. 10.1007/s10479-010-0825-8
- By:
- Publication type:
- Article