×

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. (English) Zbl 1189.68014

Lecture Notes in Computer Science 6140. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). xi, 369 p. (2010).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1163.68006).
Indexed articles:
Stuckey, Peter J., Lazy clause generation: combining the power of SAT and CP (and MIP?) solving, 5-9 [Zbl 1285.68166]
Beldiceanu, Nicolas; Carlsson, Mats; Flener, Pierre; Pearson, Justin, On matrices, automata, and double counting, 10-24 [Zbl 1285.68147]
Beldiceanu, Nicolas; Hermenier, Fabien; Lorca, Xavier; Petit, Thierry, The increasing Nvalue constraint, 25-39 [Zbl 1285.68148]
Benchimol, Pascal; Régin, Jean-Charles; Rousseau, Louis-Martin; Rueher, Michel; van Hoeve, Willem-Jan, Improving the Held and Karp approach with constraint programming, 40-44 [Zbl 1285.68149]
Benoist, Thierry, Characterization and automation of matching-based neighborhoods, 45-50 [Zbl 1285.68150]
Berthold, Timo; Feydy, Thibaut; Stuckey, Peter J., Rapid learning for binary programs, 51-55 [Zbl 1285.68151]
Cambazard, Hadrien; O’Mahony, Eoin; O’Sullivan, Barry, Hybrid methods for the multileaf collimator sequencing problem, 56-70 [Zbl 1285.68152]
Chu, Geoffrey; de la Banda, Maria Garcia; Stuckey, Peter J., Automatically exploiting subproblem equivalence in constraint programming, 71-86 [Zbl 1285.68153]
Coban, Elvin; Hooker, John N., Single-facility scheduling over long time horizons by logic-based Benders decomposition, 87-91 [Zbl 1285.68154]
Dilkina, Bistra; Gomes, Carla P., Solving connected subgraph problems in wildlife conservation, 102-116 [Zbl 1285.68155]
Dupuis, Julien; Schaus, Pierre; Deville, Yves, Consistency check for the bin packing constraint revisited, 117-122 [Zbl 1285.68156]
Fischetti, Matteo; Salvagnin, Domenico, A relax-and-cut framework for Gomory’s mixed-integer cuts, 123-135 [Zbl 1285.90017]
Fischetti, Matteo; Salvagnin, Domenico, An in-out approach to disjunctive optimization, 136-140 [Zbl 1285.90018]
Grandcolas, Stéphane; Pinto, Cédric, A SAT encoding for multi-dimensional packing problems, 141-146 [Zbl 1285.90048]
Grimes, Diarmuid; Hebrard, Emmanuel, Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach, 147-161 [Zbl 1285.68157]
Jain, Siddhartha; Kadioglu, Serdar; Sellmann, Meinolf, Upper bounds on the number of solutions of binary integer programs, 203-218 [Zbl 1285.90050]
Kasiviswanathan, Shiva Prasad; Pan, Feng, Matrix interdiction problem, 219-231 [Zbl 1285.68214]
Khichane, Madjid; Albert, Patrick; Solnon, Christine, Strong combination of ant colony optimization with constraint programming optimization, 232-245 [Zbl 1285.68158]
Moss, Anna, Constraint programming with arbitrarily large integer variables, 252-266 [Zbl 1285.68159]
Pham, Quang Dung; Deville, Yves; Van Hentenryck, Pascal, Constraint-based local search for constrained optimum paths problems, 267-281 [Zbl 1285.68160]
Prestwich, Steve D.; Tarim, S. Armagan; Rossi, Roberto; Hnich, Brahim, Stochastic constraint programming by neuroevolution with filtering, 282-286 [Zbl 1285.68161]
Régin, Jean-Charles; Rousseau, Louis-Martin; Rueher, Michel; van Hoeve, Willem-Jan, The weighted spanning tree constraint revisited, 287-291 [Zbl 1285.68162]
Saad, Aya; Gervet, Carmen; Abdennadher, Slim, Constraint reasoning with uncertain data using CDF-intervals, 292-306 [Zbl 1285.68163]
Schaus, Pierre; Van Hentenryck, Pascal; Zanarini, Alessandro, Revisiting the soft global cardinality constraint, 307-312 [Zbl 1285.68164]
Berthold, Timo; Heinz, Stefan; Lübbecke, Marco E.; Möhring, Rolf H.; Schulz, Jens, A constraint integer programming approach for resource-constrained project scheduling, 313-317 [Zbl 1285.90045]
Yip, Justin; Van Hentenryck, Pascal; Gervet, Carmen, Boosting set constraint propagation for network design, 339-353 [Zbl 1285.90055]
Zanarini, Alessandro; Pesant, Gilles, More robust counting-based search heuristics with alldifferent constraints, 354-368 [Zbl 1285.68167]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C27 Combinatorial optimization
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1163.68006
PDF BibTeX XML Cite
Full Text: DOI