AND/OR Branch-and-Bound on a Computational Grid
From MaRDI portal
Publication:5370989
DOI10.1613/jair.5456zbMath1418.68189OpenAlexW2738063883WikidataQ129489076 ScholiaQ129489076MaRDI QIDQ5370989
Publication date: 24 October 2017
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.5456
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ A review of literature on parallel constraint solving ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ Variable neighborhood search for graphical model energy minimization
This page was built for publication: AND/OR Branch-and-Bound on a Computational Grid
