Enumerative branching with less repetition

DOI10.1007/978-3-030-58942-4_26OpenAlexW3088979603MaRDI QIDQ2110431

Thiago Serra

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_26

zbMATH Keywords

integer programmingbranch-and-bounddepth-first searchdecision diagramssolution enumeration

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Related Items (1)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

This page was built for publication: Enumerative branching with less repetition