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

Stop Branch-and-Price tree and return gap

I implemented a branch-and-price tree in python. I would like to stop the process after 5 hours and return the gap in % between the best integer solution found so far and the optimal solution. How do I give a value to SCIP and ask it to return the…
User123456789
  • 149
  • 10
0
votes
1 answer

How to model this MILP problem in python?

I have a problem that I want to solve but I cant figure out how to model it Before asking here I made research and find things that will help but I couldnt wrap my head around it. Example of problem I have below So I have many items lets say 40,…
R. Carlson
  • 9
  • 2
0
votes
1 answer

What is the point of matrix reduction in Branch & Bound problems?

Pretty much as the title says. This is done in branch & bound problems, specifically the travelling salesperson. I understand how matrix reduction works, but I don't really get why you need to do it. Thanks.
Aaron Safer-Rosenthal
  • 11
0
votes
1 answer

How to solve a problem with using the method of branches and borders?

All words of the ternary language consist of only 3 letters: a, b, and c and all have a strictly specified length N. Words that do not contain two identical subsequences of letters in a row are considered correct. For example, abcacb is the correct…
Coffee inTime
  • 231
  • 1
  • 8
0
votes
1 answer

How to activate (or inactivate) cuts in Gurobi, with python? And where do I find a documentation of these cuts?

I'm trying to adapt a model, using python, and trying to improve it by inactivate and activate some heuristics of B&C. For that, I'm looking for some help with how to manage parameters for cut heuristics and what types do I have in Gurobi.
MrPlanta
  • 1
0
votes
1 answer

Branch and bound algorithm for maximization of importance

I have a problem that should be solved with branch and bound algorithm, however i'm having a hard time thinking how to solve it. I'cant figure out how to start the branch and bound algorithm. Here is the problem: A car has a maximum weight and…
jmca
  • 3
  • 2
0
votes
0 answers

I don't know why this code isn't work

The breadth first search with branch-and-bound pruning code for the 0-1 knapsack problem I typed code almost same way as pesudo code. But it occurs error. Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 4 at…
Ben Kwon
  • 21
  • 2
0
votes
1 answer

Modified knapsack with branch and bound method

So the problem I have is the following : there is a set of N categories of objects, in each category there are M objects, each with a specified value and weight. We have to pick one object from each category so that the weight is <= some given…
Miyavistka
  • 23
  • 3
0
votes
1 answer

Error in compiling the c code

The following code for 0/1 knapsack using branch and bound method shows the errors: line 15: 'Item' cannot start a parameter declaration. line 15: ) expected. The same is observed for the function bound. #include …
user7220594
0
votes
1 answer

Perl deleting array elements after a few iterations of code, with a call to a sub function

My code works for the first few iterations, but after a few times through the while loop, it seems that my array elements are being deleted. I'm taking numbers off the array constructed from the input parameters and all I can tell is that when I…
Sam
  • 1,765
  • 11
  • 82
  • 176
0
votes
1 answer

SCIP using old code

I am kind of new to the SCIP. I want to use SCIP as a branch and price framework. I have coded the problem in C++ already and also have implemented the pricer or column generation as a function. In fact I have implemented the BP algorithm for the…
math2014
  • 55
  • 7
0
votes
0 answers

Branch and Bound approach for solving Longest Common Subsequence(LCS).

Is there a way to solve longest common subsequence(LCS) problem using branch and bound technique. I understand branch and bound but I am not able to apply the technique to solve LCS. Just wanted forum opinion to point in right direction to find the…
zeal
  • 465
  • 2
  • 11
  • 22
0
votes
1 answer

Algorithm for optimal meeting role allocation based on attendee stated level of interest

I'm trying to find out the best techniques or resources to help me solve an optimization problem. The problem is to optimally match meeting attendees with predefined roles. Prior to the meeting, an attendee with decide for each role whether he or…
ForsakenCubist
  • 21
  • 3
0
votes
1 answer

CPLEX heuristics give different computational results

when we solve a maximization mip problem using cplex, can cplex heuristics affect the upper bound of the objective value? as far as I understand, cplex heuristic can improve the lower bound of the optimal value but NOT the upper bound. but in my…
abouttime
  • 1
0
votes
1 answer

Branch And Bound not working in OptaPlanner

I have a Directed Acyclic Graph, arcs are Entities and Weights associated do each Arc are the PlanningVariables. I use: @ValueRangeProvider(id = "bufferRange") public CountableValueRange getDelayRange() { return…
the_grandson
  • 15
  • 10
1 2 3 4 5
6
7 8