Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27--31, 2009. Proceedings

DOI10.1007/978-3-642-01929-6zbMath1163.68006OpenAlexW1533856049MaRDI QIDQ1018865

No author found.

Publication date: 26 May 2009

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-01929-6

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

Exact and meta-heuristic approaches for the production leveling problem ⋮ On the complexity of finding shortest variable disjunction branch-and-bound proofs ⋮ A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ How important are branching decisions: fooling MIP solvers ⋮ Improving strong branching by domain propagation ⋮ Computational aspects of infeasibility analysis in mixed integer programming