The Power of Dominance Relations in Branch-and-Bound Algorithms
From MaRDI portal
Publication:4133408
DOI10.1145/322003.322010zbMath0357.90043OpenAlexW2042886174MaRDI QIDQ4133408
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322003.322010
Related Items
On a resource-constrained scheduling problem with application to distributed systems reconfiguration ⋮ Systolic processing for dynamic programming problems ⋮ A new variant of the \(A^*\)-algorithm which closes a node at most once. ⋮ A simulation tool for the performance evaluation of parallel branch and bound algorithms ⋮ Data-dependency graph transformations for instruction scheduling ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Compact representation of near-optimal integer programming solutions ⋮ Dominance rules in combinatorial optimization problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Combinatorial optimization problems in wireless switch design ⋮ Generalized best first search using single and multiple heuristics ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Heuristic estimates in shortest path algorithms ⋮ On the exact separation of mixed integer knapsack cuts ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Using branch-and-bound algorithms to obtain suboptimal solutions ⋮ A hybrid approach to discrete mathematical programming ⋮ Discrete Optimization with Decision Diagrams ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ Dominance breaking constraints ⋮ The application of automated reasoning to formal models of combinatorial optimization ⋮ Robust algorithms: a different approach to oracles
This page was built for publication: The Power of Dominance Relations in Branch-and-Bound Algorithms
