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
0 answers

Branch & Bound Knapsack Algorithm

I have to implement an algorithm for the best first, branch and bound knapsack problem. However, my algorithm doesn't give me the right answer. My KWF2 function to find out the upper bound works, but calling knapsack(0,0,0,n) gives me a very off…
Dylan
  • 89
  • 4
0
votes
0 answers

matlab bnb20 errmsg = Error using mofitness. Not enough input arguments

I am trying to use Koert Kuipers' matlab code for branch and bound: BNB20. I keep getting ' Error using mofitness (line 4) Not enough input arguments.' 'Error in bnbmo (line 37) [errmsg,Z,X,t,c,fail]=...' Here is the main script with the…
Moni
  • 93
  • 1
  • 14
0
votes
1 answer

Diffrence between ATSP and TSP

this might be a slightly foolish question, but what is the exact diffrence in solving TSP and ATSP. I've always thought that in ATSP you need to compute the way back(since the input matrix is assymetric). So the path for ATSP is twice as long as…
Greenmachine
  • 292
  • 1
  • 15
0
votes
1 answer

Best matches of nodes using branch and bound

The idea for this problem is to explore all nodes and all their neighbors of a undirected graph. Each union has an associated weight. The idea is to make the maximum possible pairing with minimal weight. Considering that once the pair created, you…
Backglass
  • 89
  • 3
  • 11
0
votes
1 answer

not BOUND in this code of the TSP?

I want to know how I could do the BOUND because I generates all possible solutions matrix tsp but not the bound. The problem is the travelling salesman. Is it possible to do this? public void bnb (int from, ArrayList followedRoute) { if…
Germán Méndez
  • 40
  • 7
0
votes
1 answer

Branch and Bound Knapsack Java

import java.io.*; import java.util.*; class node{ int level; int profit; int weight; int bound; } public class KnapsackBB{ public static void main(String args[])throws Exception{ int maxProfit; …
user5592602
  • 13
  • 3
0
votes
0 answers

TSP branch and bound - sometimes incorrect results C#

I need to solve the TSP problem with the branch and bound algorithm. Here's the code. The problem is, the code works only in small instances (i.e. three cities), but also it isn't working every time. I've been looking for some mistakes but I…
tim.bek
  • 1
  • 1
0
votes
0 answers

Are there exact methods to solve the Path cover in bipartite graphs?

We consider a simple graph G =(V; E). The well known Path Cover problem (https://en.wikipedia.org/wiki/Path_cover) is NP-complete on all graph classes on which the Hamiltonian path problem is NP-complete, including planar graphs, bipartite graphs…
Farah Mind
  • 143
  • 5
0
votes
1 answer

UB must be a real valued nx by 1 column vertor error in MATLAB

I am trying to implement a recursive function for branch and bound algorithm. each time of calling my algorithm recursively I am changing my lb and ub value in the recursive call. it is showing the error UB must be a real valued nx by 1 column…
Cherry
  • 971
  • 1
  • 10
  • 20
0
votes
1 answer

branch & bound error : Node1 cannot be cast to java.lang.Comparable

I am trying to implement branch & bound search algorithm in java. I know its concept (how it works), but I am not sure how to implement it. I found some examples on google but they are way more complex and I can't seem to understand them. I want to…
Dee
  • 483
  • 2
  • 11
  • 24
0
votes
1 answer

Program branch and bound for covering points with axis parallel lines in Linear programming using matlab/octave

I am trying to implement branch and bound technique for covering points with axis parallel lines. for each sub problem I am considering my LP solution as the LB and iterative rounding solution as the UB. At first I am considering a fractional valued…
Cherry
  • 971
  • 1
  • 10
  • 20
0
votes
1 answer

Complexity of branch and bound for finding optimal Boolean assignment in a logic-constrained graph

The problem: I have a graph in which the boolean state of each vertex is constrained by a logical relation given the states of connected vertices. The edges describe reactions, where each reaction has a set of activators (that promote it),…
rm-rf-slash
  • 3
  • 3
0
votes
0 answers

0-1 integer liner form Branch and bound Algo

I have implemented branch and bound algorithm , the algorithm is as follows: find the optimal solution to the linear programming model with the integer restrictions relaxed. at node 1 let the relaxed solution be the upper bound and the rounded down…
user3598674
  • 1
0
votes
1 answer

Branch and bound using Perl

I have a problem, I cannot find an answer to. I am using Perl. My input is a symmetric cost-matrix, kind of like the TSP. I want to know all solutions that lie beneath my boundary, which is 10. This is my matrix: - B E G I K L P S …
ika
  • 1
  • 1
0
votes
1 answer

Getting started with MapReduce version 2

Good morning, I did not succeed to find a mapReduce example on YARN (i.e. The 2nd version of MapReduce), the one that is always presented is WordCount which is just the very same code as the one presented on the first version of MapReduce. Even…
Hadoop User
  • 114
  • 1
  • 10
1 2 3 4 5 6
7
8