Pages that link to "Item:Q6041109"

The following pages link to Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109):

Displaying 10 items.

• Improving branch-and-cut performance by random sampling (Q266414) (← links)
• Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
• Incumbent solutions in branch-and-bound algorithms: Setting the record straight (Q1915957) (← links)
• Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
• Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
• Early estimates of the size of branch-and-bound trees (Q2892274) (← links)
• Predicting the solution time of branch-and-bound algorithms for mixed-integer programs (Q2899130) (← links)
• On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
• Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)