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
1
vote
1 answer

Branch and Bound approach to the edit distance algorithm

I am trying to implement Branch and Bound approach to the edit distance algorithm. I can't find any hints over internet to start with. Can anyone help me to get into the track of the algorithm.
Dark Star
  • 43
  • 9
1
vote
1 answer

Branch and bound strategy for longest path implementation

I am working on a problem which i have to solve with a branch and bound algorithm. Let's say we have n gas stations with different distance values from the starting point. Stations have different profits. We want to maximize the profit but each…
Firat Faruk EREN
  • 81
  • 1
  • 4
1
vote
0 answers

How to find the smallest package that can contain a set of items?

how can I generalize the 3D single bin packing algorithm in order to find the smallest bin dimensions that can contains the set of items? I'm looking at a branch and bound algorithm, is there a condition that let me cut a branch rather than the…
Michele mpp Marostica
  • 2,445
  • 4
  • 29
  • 45
1
vote
1 answer

Matching paths to graph using branch & bound

I am working on an approximate matching problem, where I have a set of paths in an unknown graph (A) and a partial graph (B), where B is incrementally generated and growing. The problem is to match the edges in the paths to the graph B, while…
shauvik
  • 3,912
  • 2
  • 23
  • 18
1
vote
0 answers

Pseudocode for Branch and Bound method to solve TSP.

I'm looking for a pseudocode for B&B algorithm for Travelling Salesman problem. I found this: TSP - Branch and bound but links that somebody gave there as an answer didn't help me so far. Do you have any examples os that pseudocode? Thank you in…
user3448282
  • 2,629
  • 3
  • 25
  • 47
1
vote
1 answer

Plot a set of inequalities for branch and bound problems in Mathematica

I'm studying the behavior of the branch and bound algorithm in a integer 2-variable linear problem. I occasionally use Wolfram Alpha for plotting graphs, but now I need a more robust option, Mathematica. I need to plot the viable zone of a set of…
alfablac
  • 55
  • 6
1
vote
1 answer

Integer programming Branch and Bound Method on C

I'm flashing a board where I need to use an algorithm that maximize an expression like s = c1*x1 + c2*x2 + c3*x3 + c4*x4 subject to some constraints. For example Maximize p = x+y subject to x+y <= 2, 3x+y >= 4 Optimal Solution: p = 2; x = 1, y =…
Temato
  • 11
  • 2
1
vote
1 answer

Knapsack Branch and Bound

I have following data : item weight value value/weight 1 5 40 8 2 2 10 5 3 6 30 5 4 1 12 12 5 2 18 9 Capacity is 10. How to proceed with calculating upper…
Dangling Cruze
  • 3,283
  • 3
  • 32
  • 43
1
vote
1 answer

Comparing multiple price options for many customers algorithmically

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 B. Price A and Price B are not linear to each other. In some cases B is 2 times as expensive, in some it is 100 times. cost…
Rizwan Kassim
  • 7,931
  • 3
  • 24
  • 34
1
vote
2 answers

C code for Branch and Bound Issue

So i think I am on the right track using the branch and bound method to solve my heuristic solution to the traveling problem, however, I get a segmentation fault in my "least" function, but I am still having a hard time wrapping my head around the…
Dillon Stout
  • 19
  • 1
  • 2
1
vote
1 answer

Branch and Bound - what to store

I have read in more than one book (including Wolsey) that when implementing a branch and bound algorithm, one does not need to store the whole tree, just a list of active nodes (leaf nodes, for what I understand). The thing is, I could not…
Izabela
  • 333
  • 1
  • 3
  • 15
1
vote
1 answer

Advantage of Using backtracking and branch and bound

I understand that DP gives a better performance for many NP complete problems like TSP. Though the space needed is large, it reduces the complexity well. But I couldn't understand the efficiency of branch and bound and backtracking as compared to an…
user567879
  • 5,139
  • 20
  • 71
  • 105
0
votes
1 answer

Can I write Gurobi log file in csv form?

I am wondering if I can have my Gurobi log file in different formats other than txt file. For instance, is there a Gurobi feature/module/code/whatever that I can change the branch-and-cut tree search section of the log (example shown below) into…
mjsl
  • 1
0
votes
0 answers

Solving Linear Program with Branch-and-Bound

I am trying to solve a linear integer programming problem with Branch-and-Bound. Therefore, I calculated the optimal solution (relaxation) first and got 4 values: x1: 84.949144123197641 x2: 80.6791757549221 x3: 0 x4: 38.459016105691269 My Target…
OXO
  • 391
  • 1
  • 8
0
votes
0 answers

R leaps package error in coef when collinear variables

The leaps package in R will automatically rearrange variables when it detects a linear dependency between variables. This is causing coef and plot to fail. Below is an example of the warning that occurs when collinear variables are…
Jacob Strunk
  • 1
  • 1
1 2 3
4
5 6 7 8