Branch-and-bound solves random binary IPs in poly(n)-time

Mathematics

• Integer 100%
• Linear Programming 100%
• Probability Theory 50%
• Polynomial 50%
• Worst Case 50%
• Fixed Number 50%
• Main Result 50%
• Objective Function 50%
• Coefficient Matrix 50%
• Parent Node 50%
• Random-Integer 50%

Keyphrases

• Branch-and-bound 100%
• Branch-and-bound Algorithm 33%
• Linear Solver 33%
• Mixed Integer Linear Programming 33%
• Coefficient Matrix 16%
• Understanding Why 16%
• Node number 16%
• Integer Programming 16%
• Disjunction 16%
• Parent Node 16%
• Random Instances 16%