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

Solve ILP with Branch and Bound and CPLEX C++

I want to solve an ILP using a branch and bound algorithm for a graph labelling problem. My ILP has an objective function and constraints for every possible pair of nodes from the graph. So I have n^2 / 2 possible constraints, and the constraints…
m6rco
  • 35
  • 5
1
vote
3 answers

Branch and bound without assert / retract

This exercise asked me to find the best combination of three products, given the prices and specific combinations to avoid. The textbook employs assertz and retractall to emulate a state variable. price(a1, 1900). price(a2, 750). price(a3, …
vasily
  • 2,850
  • 1
  • 24
  • 40
1
vote
2 answers

Extended version of the set cover problem

I don't generally ask questions on SO, so if this question seems inappropriate for SO, just tell me (help would still be appreciated of course). I'm still a student and I'm currently taking a class in Algorithms. We recently learned about the…
roblox99
  • 117
  • 4
1
vote
1 answer

How to to get selected items in Branch and Bound knapsack implementation in python?

I tried the implementation given here for knapsack problem using Branch and Bound. The solution seems fine but it doesn't give the final selected items to reach the optimal value. Is there a way to get this by changing the following code…
Vinay
  • 1,149
  • 3
  • 16
  • 28
1
vote
0 answers

Coin-or-Cbc not solve same instance in same time CPU when running several times

I wonder why if we run several times exactly the same instance in Cbc Coin-or, we get always the same solution, but not in a same solving time. Is it because of random choices during the branch and cut ? Is it because of threads matters ? If someone…
albin cintas
  • 31
  • 3
1
vote
0 answers

Is there ever an application of branch and bound where FIFO is better than LIFO or LCBB?

I understand the difference between FIFO B&B, LIFO B&B, and LCBB, but I just can't think of why you would possibly want to do FIFO since it results in a breadth-first search instead of depth first. After all, if you can quickly find a better…
tupion
  • 11
  • 1
1
vote
1 answer

Why does the variable select strategy of CPLEX influence the user branch decisions? (Python)

I followed the example to branch using make_branch() in the control(branch) callback of the MIP. But I noticed that the solving processes differ surprisingly under different settings of the variable select strategy. How was it possible since I…
Icarus
  • 25
  • 4
1
vote
1 answer

Adding new element in python Queue is changing all previous values to the latest value (implementing all previous StackOverflow answers)

Short version for problem in link -> https://codereview.stackexchange.com/q/227081/207512 Here is a short code snippet for the problem While coding for 0/1 Knapsack using Branch and Bound in python, I used a queue from the queue module, to store all…
RJ_SU
  • 31
  • 9
1
vote
1 answer

How to combine large list of lists (of lists again) under certain condition

I am trying to solve a problem coming from the area of biology in which I have to combine local sub-optimal solutions from each big element such that each sub particle is unique. The problem is that the possibilities could scale up to +4.000 local…
Hardin Salvor
  • 11
  • 3
1
vote
1 answer

How to add attributes to PySCIPOpt classes

Problem I'm using PySCIPOpt to implement a branch and price algorithm in SCIP. I would like to add additional attributes to pyscipopt.scip.Variable objects (this is the class that PySCIPOpt uses to handle model variables) in order to store…
netword
  • 113
  • 2
  • 13
1
vote
1 answer

What is the difference between Integer Quadratic Programming versus Mixed Integer Quadratic Programming?

I am new to the optimization problem of Quadratic programming. In equation 8 of the following paper: here , there is an equation: The authors state that this is an 'Integer Quadratic Programming (IQP)' formula. Alternatively, in another website:…
user121
  • 849
  • 3
  • 21
  • 39
1
vote
2 answers

Branch and bound implementation

I've been working on this problem, and I can get some results, but I'm having trouble implementing the branch and bound method here. Can you guys help me? Building Warehouses Description After winning the lottery, you decide to buy several truks…
jtorres
  • 11
  • 2
1
vote
2 answers

What is the difference between FIFO Branch and Bound, LIFO Branch and Bound and LC Branch and Bound?

What is the difference between FIFO, LIFO and LC Branch and Bound?
Satender
  • 117
  • 1
  • 2
  • 9
1
vote
1 answer

how to understand the memory issue of breadth-first-search in branch and bound

I was confused by the branch and bound method recently. There are three searching strategies in branch-and-bound method: deepth-first-search, breadth-first-search and best-first-search. All the books and literatures state that the breadth-first and…
user3034556
  • 41
  • 2
1
vote
0 answers

Branch and Bound Algorithm for solving Assignment-probleem

I started doing Branch and Bound Algorithm for assignment problem in C++ and i can't find the right solution. First of all assignment problem example: Assignment problem Ok so each person can be assigned to one job, and the idea is to assign each…
whyunomad
  • 11
  • 3
1 2
3
4 5 6 7 8