×

Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23–27, 2011. Proceedings. (English) Zbl 1214.68003

Lecture Notes in Computer Science 6697. Berlin: Springer (ISBN 978-3-642-21310-6/pbk). x, 253 p. (2011).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see Zbl 1189.68014.
Indexed articles:
Lodi, Andrea, On bilevel programming and its impact in branching, cutting and complexity. (Abstract), 3 [Zbl 1302.90213]
Aschinger, Markus; Drescher, Conrad; Friedrich, Gerhard; Gottlob, Georg; Jeavons, Peter; Ryabokon, Anna; Thorstensen, Evgenij, Optimization methods for the partner units problem, 4-19 [Zbl 1302.90164]
Bergman, David; van Hoeve, Willem-Jan; Hooker, John N., Manipulating MDD relaxations for combinatorial optimization, 20-35 [Zbl 1302.90166]
Bessiere, Christian; Narodytska, Nina; Quimper, Claude-Guy; Walsh, Toby, The AllDifferent constraint with precedences, 36-52 [Zbl 1326.68266]
Chapados, Nicolas; Joliveau, Marc; Rousseau, Louis-Martin, Retail store workforce scheduling by expected operating income maximization, 53-58 [Zbl 1302.90075]
Coffrin, Carleton; Van Hentenryck, Pascal; Bent, Russell, Spatial and objective decompositions for very large SCAPs, 59-75 [Zbl 1302.68250]
Dilkina, Bistra; Lai, Katherine J.; Gomes, Carla P., Upgrading shortest paths in networks, 76-91 [Zbl 1302.90232]
Edis, Emrah B.; Oguz, Ceyda, Parallel machine scheduling with additional resources: a Lagrangian-based constraint programming approach, 92-98 [Zbl 1302.90078]
Januschowski, Tim; Pfetsch, Marc E., Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry, 99-116 [Zbl 1302.90256]
Lahimer, Asma; Lopez, Pierre; Haouari, Mohamed, Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks, 117-130 [Zbl 1302.90085]
Lodi, Andrea; Pesant, Gilles; Rousseau, Louis-Martin, On counting lattice points and Chvátal-Gomory cutting planes, 131-136 [Zbl 1302.90257]
Lombardi, Michele; Bonfietti, Alessio; Milano, Michela; Benini, Luca, Precedence constraint posting for cyclic scheduling problems, 137-153 [Zbl 1302.90087]
Nannicini, Giacomo; Belotti, Pietro; Lee, Jon; Linderoth, Jeff; Margot, François; Wächter, Andreas, A probing algorithm for MINLP with failure prediction by SVM, 154-169 [Zbl 1302.90160]
Pesant, Gilles; Zanarini, Alessandro, Recovering indirect solution densities for counting-based branching heuristics, 170-175 [Zbl 1326.68267]
Régin, Jean-Charles, Using hard constraints for representing soft constraints, 176-189 [Zbl 1326.68269]
Régin, Jean-Charles; Petit, Thierry, The objective sum constraint, 190-195 [Zbl 1326.68270]
Simonis, Helmut; O’Sullivan, Barry, Almost square packing, 196-209 [Zbl 1302.90191]
Sivanthi, Thanikesavan; Poland, Jan, Efficient planning of substation automation system cables, 210-214 [Zbl 1302.90125]
Subramani, K.; Worthington, James, A new algorithm for linear and integer feasibility in Horn constraints, 215-229 [Zbl 1302.90126]
Vilím, Petr, Timetable edge finding filtering algorithm for discrete cumulative resources, 230-245 [Zbl 1302.90090]
Zanarini, Alessandro; Van Hentenryck, Pascal, Identifying patterns in sequences of variables, 246-251 [Zbl 1302.90093]

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 1189.68014
PDFBibTeX XMLCite
Full Text: DOI