Stack Overflow
Stack Overflow

Questions tagged [branch-and-bound]

Branch and bound is a general technique for finding optimal solutions of various combinatorial and integer programming problems. It entails examining candidates (“branches”), while utilizing knowledge of upper and lower limits (“bounds”) to eliminate sub-trees, to find the optimal solution quicker.

Branch and bound is a general technique for finding optimal solutions of various combinatorial and integer programming problems. It involves partial enumeration, by examining candidates (“branches”), while also utilizing knowledge of upper and lower limits (“bounds”) to eliminate sub-trees.

The B&B technique is widely used in discrete optimization problems where the solution falls in the integer space (Traveling salesman, cutting stock etc.) This method was introduced in 1960.

For further reference: The Wikipedia page on Branch-and-bound (B&B)

114 questions
0
votes
1 answer

number of levels in a branch and bound tree

Given a ILP (Integer-linear programming) optimization with n integer variables and m constraints and implementing a branch and bound tree for solving a canonical problem, how many levels (height of tree) does tree require to reach the…
Mohammad Namakshenas
  • 83
  • 1
  • 12
0
votes
2 answers

Will all TSP algorithms give the same optimum route?

I was just wondering if all algorithms for the TSP will give the same optimum routes? I thought that this would be the case but ive implemented branch and bound and A* and they both give very different results to the same input, I was just wondering…
thrash
  • 187
  • 1
  • 4
  • 18
-1
votes
1 answer

Do dynamic programming and branch and bound give same result when solving 0/1 knapsack problem?

Hi I have a question about knapsack problem and it's algorithms. I have built some code to solve 0/1 knapsack problem with Dynamic Programming and Branch and Bound. The value and weight are randomly generated. I ran the program and obtain the result…
Ohtani King
  • 1
-1
votes
1 answer

Implement different algorithm to find dominant object with several parameter in typescript

I have some student's profile with values on several subjects like physics, chemistry and math. I need find a list of dominant students depending on individual score on subjects. For example: let students = [{name: "A", phy: 70, chem: 80, math:…
ImtiazNur
  • 250
  • 2
  • 13
-1
votes
1 answer

Get Branch and Bound (BAB) tree structure

I want to achieve the BAB tree structure like, I am trying to use R, matlab and CPLEX, but cannot figure it out.
jyfeather
  • 54
  • 6
-3
votes
1 answer

How do I get around this? IndexError: list index out of range

When I run my code, I receive this IndexError: constraints[fr][to] = self.extra_constr[2] IndexError: list index out of range Here a sample of my code: def determine_constr(self, parent_constr): constraints = copy.deepcopy(parent_constr) …
David Richmond
  • 7
  • 4
-3
votes
1 answer

Searching for the best fit price for multiple customers

A restatement of Comparing multiple price options for many customers algorithmically without nearly as much cruft. We have 1,000,000 customers. The cost of goods sold for each of them can be expressed as price A or price B. Price A << Price…
Rizwan Kassim
  • 7,931
  • 3
  • 24
  • 34
-3
votes
1 answer

InputMismatchException reading decimal fractions

In the main() function of http://penguin.ewu.edu/cscd501/Wint-2011/BranchAndBound/Knap01BnB.txt inp = new Scanner ( new File(lineIn) ); maxWeight = inp.nextInt(); n = inp.nextInt(); System.out.printf ("Reading data from file %s, with %d…
user1632981
  • 1
-5
votes
1 answer

Chasing game in C

I'm stuck with a quite complex problem: On an MxN field containing a chicken, an eagle and a yard, the chicken tries to escape the eagle (by entering the yard), and the eagle tries to catch the chicken. The chicken escapes when reaches…
Camelia
  • 5
  • 4
1 2 3 4 5 6 7
8