Result 1 to 20 of 94 total
Filtering algorithms for global chance constraints. (English)
Artif. Intell. 189, 69-94 (2012).
1
Partial symmetry breaking by local search in the group. (English)
Constraints 17, No. 2, 148-171 (2012).
2
Covering points with orthogonally convex polygons. (English)
Comput. Geom. 44, No. 5, 249-264 (2011).
3
A survey on CP-AI-OR hybrids for decision making under uncertainty. (English)
Milano, Michela (ed.) et al., Hybrid optimization. The ten years of CPAIOR. New York, NY: Springer (ISBN 978-1-4419-1643-3/hbk; 978-1-4419-1644-0/ebook). Springer Optimization and Its Applications 45, 227-270 (2011).
4
Finding $(α, ϑ)$-solutions via sampled scsps (English)
IJCAI, 2172-2177 (2011).
5
Extensible automated constraint modelling (English)
AAAI (2011).
6
Covering oriented points in the plane with orthogonal polygons is NP-complete. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 303-310 (2010).
7
Simultaneous balancing and scheduling of flexible mixed model assembly lines with sequence-dependent setup times. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 65-72 (2010).
8
Stochastic constraint programming by neuroevolution with filtering. (English)
Lodi, Andrea (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14‒18, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). Lecture Notes in Computer Science 6140, 282-286 (2010).
9
Scheduling internal audit activities: a stochastic combinatorial optimization problem. (English)
J. Comb. Optim. 19, No. 3, 325-346 (2010).
10
Covering oriented points in the plane with orthogonal polygons is NP-complete (English)
Electronic Notes in Discrete Mathematics 36, 303-310 (2010).
11
Simultaneous balancing and scheduling of flexible mixed model assembly lines with sequence-dependent setup times (English)
Electronic Notes in Discrete Mathematics 36, 65-72 (2010).
12
Stochastic constraint programming by neuroevolution with filtering (English)
CPAIOR, 282-286 (2010).
13
Multiset ordering constraints. (English)
Comput. Res. Repos. 2009, Article No. 0905.3769 (2009).
14
The complexity of reasoning with global constraints. (English)
Comput. Res. Repos. 2009, Article No. 0903.1139 (2009).
15
SLIDE: A useful special case of the CARDPATH constraint. (English)
Comput. Res. Repos. 2009, Article No. 0903.0471 (2009).
16
The parameterized complexity of global constraints. (English)
Comput. Res. Repos. 2009, Article No. 0903.0467 (2009).
17
Filtering algorithms for the multiset ordering constraint. (English)
Comput. Res. Repos. 2009, Article No. 0903.0460 (2009).
18
Range and roots: two common patterns for specifying and propagating counting and occurrence constraints. (English)
Comput. Res. Repos. 2009, Article No. 0903.0211 (2009).
19
Evolving parameterised policies for stochastic constraint programming. (English)
Gent, Ian P. (ed.), Principles and practice of constraint programming ‒ CP 2009. 15th international conference, CP 2009, Lisbon, Portugal, September 20‒24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04243-0/pbk). Lecture Notes in Computer Science 5732, 684-691 (2009).
20
Result 1 to 20 of 94 total
Start
Contact
Print
General Help
