Skip to main content

Questions tagged [branch-and-bound]

For questions related to the branch-and-bound method for integer programming problems, which recursively divides the solution space and identifies upper and lower bounds on the optimal objective function value.

Filter by
Sorted by
Tagged with
11 votes
4 answers
442 views

Theoretical results on performance of branch-and-bound

Are there any theoretical results on the performance of branch-and-bound, even for a subset of instances of a particular discrete optimization problem? As an example, does there exist a result of ...
ydubey7's user avatar
  • 579
9 votes
1 answer
335 views

Rules of thumb for using classic methods (e.g. branch and bound) vs. meta-heuristics (G.A, S.A, etc..) for non-convex problems?

Are there any rules of thumb for when to use classical methods like branch and bound, branch and cut, etc...for non-convex problems, vs using meta-heuristic methods like genetic algorithms, ...
Skander H.'s user avatar
  • 2,139
12 votes
3 answers
6k views

Performance of a branch and bound algorithm VS branch-cut-heuristics

I was trying to solve a moderate scheduling model using an open-source solver. I did two different ways. A) using pure branch and bound algorithm (disable all options). B) using the default setting ...
A.Omidi's user avatar
  • 8,960
14 votes
1 answer
776 views

Estimation of the size of Branch-and-Bound trees using ML

A short background: A paper [1] published in 2006 intends to show that the time needed to solve mixed-integer programming problems by branch and bound can be roughly predicted early in the solution ...
Oguz Toragay's user avatar
  • 8,667
8 votes
2 answers
145 views

How to change the search strategy in a B&B framework, i.e., start with depth first and then continue with best node?

Is there any implementation, code or software, which can switch between search strategies in a B&B framework?
Majid's user avatar
  • 366

1
2