Node selection strategies in interval Branch and Bound algorithms

Mathematics

• Branch and Bound Algorithm 94%
• Strategy 54%
• Interval 44%
• Vertex of a graph 43%
• Constrained Global Optimization 38%
• Diversification 18%
• Upper bound 16%
• Selection Rules 16%
• Feasible region 15%
• Trade-offs 13%
• Experimental Results 12%
• Policy 12%
• Minimization Problem 11%
• Objective function 10%
• Lower bound 8%
• Performance 7%
• Standards 7%
• Operator 5%
• Estimate 5%

Business & Economics

• Branch and Bound Algorithm 100%
• Node 73%
• Global Optimization 34%
• Upper Bound 26%
• Diversification 14%
• Rule-based 13%
• Lower Bounds 12%
• Objective Function 11%
• Contracting 11%
• Operator 9%
• Trade-offs 9%
• Performance 7%

Engineering & Materials Science

• Constrained optimization 83%
• Global optimization 79%