Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings

DOI10.1007/978-3-642-29828-8zbMath1241.68008OpenAlexW2967044339MaRDI QIDQ424416

No author found.

Publication date: 1 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29828-8

Mathematics Subject Classification ID

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

Related Items

On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Weak and strong solvability of interval linear systems of equations and inequalities ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ A microkernel architecture for constraint programming ⋮ Bounds on the size of PC and URC formulas ⋮ A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ Propagation complete encodings of smooth DNNF theories