×

zbMATH — the first resource for mathematics

Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 10th international conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18–22, 2013. Proceedings. (English) Zbl 1263.68017
Lecture Notes in Computer Science 7874. Berlin: Springer (ISBN 978-3-642-38170-6/pbk). xi, 403 p. (2013).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1241.68008].
Indexed articles:
Achterberg, Tobias; Sabharwal, Ashish; Samulowitz, Horst, Stronger inference through implied literals from conflicts and knapsack covers, 1-11 [Zbl 1382.68218]
Heinz, Stefan; Ku, Wen-Yang; Beck, J. Christopher, Recent improvements using constraint integer programming for resource allocation and scheduling, 12-27 [Zbl 1382.90065]
Berthold, Timo; Salvagnin, Domenico, Cloud branching, 28-43 [Zbl 1382.90059]
Climent, Laura; Wallace, Richard J.; Salido, Miguel A.; Barber, Federico, Modeling robustness in CSPs as weighted CSPs, 44-60 [Zbl 1382.68220]
El Mouelhi, Achref; Jégou, Philippe; Terrioux, Cyril; Zanuttini, Bruno, Some new tractable classes of CSPs and their relations with backtracking algorithms, 61-76 [Zbl 1382.68222]
Heule, Marijn J. H.; Järvisalo, Matti; Biere, Armin, Revisiting hyper binary resolution, 77-93 [Zbl 1382.68223]
Hooker, John N., Decision diagrams and dynamic programming, 94-110 [Zbl 1382.90113]
Kelareva, Elena; Tierney, Kevin; Kilby, Philip, CP methods for scheduling and routing with time-dependent task costs, 111-127 [Zbl 1382.90036]
Kell, Brian; van Hoeve, Willem-Jan, An MDD approach to multidimensional bin packing, 128-143 [Zbl 1382.68224]
Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nicolas, A synchronized sweep algorithm for the \(k\)-dimensional cumulative constraint, 144-159 [Zbl 1382.68225]
Liffiton, Mark H.; Malik, Ammar, Enumerating infeasibility: finding multiple MUSes quickly, 160-175 [Zbl 1382.68226]
Malitsky, Yuri; Mehta, Deepak; O’Sullivan, Barry; Simonis, Helmut, Tuning parameters of large neighborhood search for the machine reassignment problem, 176-192 [Zbl 1382.68227]
Nyberg, Axel; Westerlund, Tapio; Lundell, Andreas, Improved discrete reformulations for the quadratic assignment problem, 193-203 [Zbl 1382.90048]
Salvagnin, Domenico, Orbital shrinking: a new tool for hybrid MIP/CP methods, 204-215 [Zbl 1382.90066]
Schichl, Hermann; Neumaier, Arnold; Markót, Mihály Csaba; Domes, Ferenc, On solving mixed-integer constraint satisfaction problems with unbounded variables, 216-233 [Zbl 1382.90067]
Schutt, Andreas; Feydy, Thibaut; Stuckey, Peter J., Explaining time-table-edge-finding propagation for the cumulative resource constraint, 234-250 [Zbl 1382.68232]
Slusky, Marla R.; van Hoeve, Willem-Jan, A Lagrangian relaxation for Golomb rulers, 251-267 [Zbl 1382.68233]
Stuckey, Peter J.; Tack, Guido, MiniZinc with functions, 268-283 [Zbl 1382.68234]
Zhang, Peter Y.; Romero, David A.; Beck, J. Christopher; Amon, Cristina H., Solving wind farm layout optimization with mixed integer programming and constraint programming, 284-299 [Zbl 1382.90050]
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Mutzel, Petra, The rooted maximum node-weight connected subgraph problem, 300-315 [Zbl 1382.90108]
Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo, An empirical evaluation of portfolios approaches for solving CSPs, 316-324 [Zbl 1382.68219]
Ciré, André; Coban, Elvin; Hooker, John N., Mixed integer programming versus logic-based Benders decomposition for planning and scheduling, 325-331 [Zbl 1382.90061]
Dang, Duc-Cuong; El-Hajj, Racha; Moukrim, Aziz, A branch-and-cut algorithm for solving the team orienteering problem, 332-339 [Zbl 1382.90118]
Gu, Hanyu; Schutt, Andreas; Stuckey, Peter J., A Lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects, 340-346 [Zbl 1382.90120]
Gamrath, Gerald, Improving strong branching by propagation, 347-354 [Zbl 1382.90062]
Gleixner, Ambros M.; Weltge, Stefan, Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming, 355-361 [Zbl 1382.90063]
Mourtos, Ioannis, Tight LP-relaxations of overlapping global cardinality constraints, 362-368 [Zbl 1382.68228]
Narodytska, Nina; Walsh, Toby, An adaptive model restarts heuristic, 369-377 [Zbl 1382.68229]
Sakti, Abdelilah; Guéhéneuc, Yann-Gaël; Pesant, Gilles, Constraint-based fitness function for search-based software testing, 378-385 [Zbl 1382.68231]
Weerakoon, Udara; Allan, Vicki, Coalition formation for servicing dynamic motion tasks, 386-393 [Zbl 1382.68240]
Wang, Jiadong; Ralphs, Ted, Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization, 394-402 [Zbl 1382.90119]

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
PDF BibTeX XML Cite
Full Text: DOI