You see that broken branch? Keep going East until you get to a big boulder. LA teaches LAOP about metes and bounds. reddit.com/r/legaladvice/…
πŸ‘︎ 79
πŸ’¬︎
πŸ‘€︎ u/monkeyman80
πŸ“…︎ Nov 30 2020
🚨︎ report
Branch and Bound - Anyone is familiar with this algo?

I'm looking to implement this algo in python, here's the problem statement:

"A bank robber is looking to rob as many banks in a day before leaving the country. I got a list of banks in the area with their location (x,y) coordinates, the amount of money they have, and the time it takes to rob it.

id,Β x_coordinate,Β y_coordinate,Β money,Β timeΒ (hr)

0,Β 11.4,Β 3.3,Β 5000,Β 0.6

1,Β 6.9,Β 7.1,Β 15000,Β 0.3

2,Β 1.4,Β 13.2,Β 900,Β 1.1

we travel at a speed of 30km/h.

I have 24 hours to make as much money as possible. Any idea how I could tackle that?

I'm open to discussing!

πŸ‘︎ 3
πŸ“°︎ r/datascience
πŸ’¬︎
πŸ‘€︎ u/yuriemond
πŸ“…︎ Nov 26 2020
🚨︎ report
How to draw a binary tree with tables in LaTeX? (Branch-and-bound Knapsack problem solution graph)

Hi r/LaTeX!

I'm trying to draw a graph to illustrate my Branch-and-bound Knapsack problem solution, but I can't find a way to draw this binary tree with the nodes being 1x2 tables.

Example: https://imgur.com/oV9aufB

I think I should draw this with TikZ but I'm just started using it, and I couldn't find the way yet. Could you help me with this?

Thanks! Stay safe everyone.

πŸ‘︎ 3
πŸ“°︎ r/LaTeX
πŸ’¬︎
πŸ‘€︎ u/iamnotstanley
πŸ“…︎ May 04 2020
🚨︎ report
If everyone voted for an independent in the US election a) would they actually end up as POYIS and b) what do you think America would be like having a branch of government run by an administration not bound by e two parties?
πŸ‘︎ 2
πŸ“°︎ r/TooAfraidToAsk
πŸ’¬︎
πŸ‘€︎ u/mooseman2234
πŸ“…︎ Apr 24 2020
🚨︎ report
Estimation in Depth-first Branch-and-bound

My question: Why does Minimum Spanning Tree act as a very fast method for lower bound estimation?

Suppose we are calculating through a DFS branch-and-bound tree of decisions. We have previously cached some actual but sub-optimal solutions at visited leaves.

Now we encounter a decision subtree, and we want to estimate a lower bound on its cost without explicitly searching through it. (If the lower bound cost along with the existing cost up to the node are already greater than cached solutions , we can prune.)

What is the method of estimation here that is genuinely faster to compute?

The rumor I have heard is that you perform Minimum-Spanning Tree , MST to obtain a lower-bound estimate. But I cannot see how this speeds up execution. An MST would seemingly process every edge in the subtree (while building a heap or whatnot), and since we are considering each edge, we might as well calculate the cost while we are at it, obtaining an actual cost, instead of an estimate.

My question: Why does Minimum Spanning Tree act as a very fast method for lower bound estimation?

πŸ‘︎ 2
πŸ“°︎ r/learnprogramming
πŸ’¬︎
πŸ‘€︎ u/moschles
πŸ“…︎ Nov 28 2019
🚨︎ report
Federal judge blasts ATF stings: "The time has come to remind the Executive Branch that the Constitution charges it with law enforcement β€” not crime creation. A reverse-sting operation like this one transcends the bounds of due process and makes the Government the oppressor of its people." usatoday.com/story/news/n…
πŸ‘︎ 4k
πŸ“°︎ r/news
πŸ’¬︎
πŸ‘€︎ u/insecuritytheater
πŸ“…︎ Mar 18 2014
🚨︎ report
What's the difference between Backtracking and Branch & Bound technique?
πŸ‘︎ 2
πŸ“°︎ r/eli5_programming
πŸ’¬︎
πŸ‘€︎ u/xaro-Xhoan-Daxos
πŸ“…︎ Nov 07 2019
🚨︎ report
Branch and Bound Algorithm Exploits/Vulnerabilities

Hi,

I'm a grad student looking for any papers to find vulnerabilities or weaknesses in the Branch and Bound algorithm. I've found it quite difficult to find any resources, so I would appreciate the assistance! Thank you :D

πŸ‘︎ 4
πŸ“°︎ r/algorithms
πŸ’¬︎
πŸ‘€︎ u/BrownYeezy
πŸ“…︎ Oct 16 2019
🚨︎ report
A Crystal Forest β€œThe air is blue and keen and cold; with snow the roads and fields are white; but here the forest’s clothed with light; and in a shining sheath enrolled; Each branch each twig each blade of grass; seems clad miraculously with glass; Above the ice-bound streamlet bends, each froz...”
πŸ‘︎ 24
πŸ“°︎ r/vianaic
πŸ’¬︎
πŸ‘€︎ u/vilhjalmurengi
πŸ“…︎ Dec 31 2018
🚨︎ report
A Basic Branch and Bound Solver in Python using Cvxpy philipzucker.com/a-basic-…
πŸ‘︎ 5
πŸ“°︎ r/Python
πŸ’¬︎
πŸ‘€︎ u/The_Regent
πŸ“…︎ Jun 13 2019
🚨︎ report
Need advice! I need to re pot this beauty and probably stake the larger branch. Should I get a large pot or do they like to be slightly root bound? Is there anything else I should do? I want to take good care of my begonia!
πŸ‘︎ 15
πŸ“°︎ r/houseplants
πŸ’¬︎
πŸ‘€︎ u/nlamps
πŸ“…︎ Aug 19 2018
🚨︎ report
pybnb 0.5 released: parallel branch-and-bound for Python reddit.com/r/Python/comme…
πŸ‘︎ 4
πŸ“°︎ r/optimization
πŸ’¬︎
πŸ“…︎ Feb 10 2019
🚨︎ report
pybnb 0.5 released: parallel branch-and-bound for Python github.com/ghackebeil/pyb…
πŸ‘︎ 4
πŸ“°︎ r/programming
πŸ’¬︎
πŸ“…︎ Feb 10 2019
🚨︎ report
pybnb: A distributed branch-and-bound library for Python
πŸ‘︎ 7
πŸ“°︎ r/Python
πŸ’¬︎
πŸ“…︎ Dec 14 2018
🚨︎ report
Bitcoin: Branch and Bound should reduce fees and increase efficiency coindesk.com/bitcoin-core…
πŸ‘︎ 6
πŸ“°︎ r/LitecoinTraders
πŸ’¬︎
πŸ‘€︎ u/SsurebreC
πŸ“…︎ Apr 02 2018
🚨︎ report
Learning F#: Case study with branch and bound youtube.com/watch?v=UZIqQ…
πŸ‘︎ 8
πŸ“°︎ r/fsharp
πŸ’¬︎
πŸ‘€︎ u/mightybyte
πŸ“…︎ Sep 25 2017
🚨︎ report
Knapsack problem using Branch and Bound method youtube.com/attribution_l…
πŸ‘︎ 2
πŸ’¬︎
πŸ“…︎ Mar 09 2018
🚨︎ report
Implementing a Java program under Branch and Bound Algorithm

The researchers would be devising a solution using the listed algorithm below to address the issue. This solution would implement an application software portable and efficient for smartphones to be shared and to be used across the world. Instead of the current algorithm accessed by taxi drivers working under Uber which promotes unnecessary fuel and time consumption because of going through all the pickup points, users would see a display of various available waiting routes all across Metro Manila (limited per city – and its landmark) as well as the record of the vehicle’s price meter – the application would display the price drop or rise every five minutes of travelling time.

This is the beginning of our research proposal. And frankly, we have no idea how to continue and finish this. Could you give us some insight on how to code a program or even where to begin in coding a program using a branch and bound algorithm (we're rooting for doing this under the assignment problem approach) that would basically make the lives of ridesharers and drivers more efficient and easier?

Note: This is a high school paper being prepared by high school students with little background on C and Java and HTML.

HUGE THANKS IN ADVANCE.

πŸ‘︎ 4
πŸ“°︎ r/computerscience
πŸ’¬︎
πŸ‘€︎ u/seventhmiachan
πŸ“…︎ Oct 12 2017
🚨︎ report
How is the gap calculated in branch and bound?

I have found two conflicting formulas for calculating the relative gap in branch and bound.

(UB - Upper Bound, LB - Lower Bound)

This blog entry says the gap is calculated as (UB - LB) / UB.

While this paper (page 12) says it's calculated as (UB - LB) / LB.

Is one of them wrong? Which one?

πŸ‘︎ 2
πŸ“°︎ r/compsci
πŸ’¬︎
πŸ‘€︎ u/devil0150
πŸ“…︎ Jul 12 2016
🚨︎ report
Calculating items included in branch and bound knapsack

Using a branch and bound algorithm I have evaluated the optimal profit from a given set of items, but now I wish to find out which items are included in this optimal solution. I'm evaluating the profit value of the optimal knapsack using the code here.

So, how can I get the items that form the optimal solution, rather than just the profit?

πŸ‘︎ 5
πŸ“°︎ r/learnpython
πŸ’¬︎
πŸ‘€︎ u/AlexPritchard
πŸ“…︎ Apr 11 2013
🚨︎ report
Federal judge blasts ATF stings: "The time has come to remind the Executive Branch that the Constitution charges it with law enforcement β€” not crime creation. A reverse-sting operation like this one transcends the bounds of due process and makes the Government the oppressor of its people." usatoday.com/story/news/n…
πŸ‘︎ 6
πŸ“°︎ r/znews
πŸ’¬︎
πŸ‘€︎ u/zorro24
πŸ“…︎ Mar 19 2014
🚨︎ report
Fast PRISM: Branch and Bound Hough Transform for Object Class Detection vision.ee.ethz.ch/publica…
πŸ‘︎ 2
πŸ“°︎ r/computervision
πŸ’¬︎
πŸ‘€︎ u/jayrambhia
πŸ“…︎ Apr 24 2013
🚨︎ report
Need help understanding branch and bound algorithms

I have a final tomorrow and understand all the concepts in my algorithms class except for branch and bound. I have googled and read my book and everything has just gone over my head. I was hoping someone could supply me with a decent explanation/example of how b&b works(please avoid using as many math symbols as possible because i have a feeling that might be a source of confusion).

examples we went over in class have been the 0-1 knapsack B&B and the a star search(still don't understand how they work).

thanks to whoever helps.

πŸ‘︎ 3
πŸ“°︎ r/learnprogramming
πŸ’¬︎
πŸ‘€︎ u/BackdoorDan
πŸ“…︎ Jun 06 2010
🚨︎ report
Estimation in Depth-first Branch-and-bound

My question: Why does Minimum Spanning Tree act as a very fast method for lower bound estimation?

Suppose we are calculating through a DFS branch-and-bound tree of decisions. We have previously cached some actual but sub-optimal solutions at visited leaves.

Now we encounter a decision subtree, and we want to estimate a lower bound on its cost without explicitly searching through it. (If the lower bound cost along with the existing cost up to the node are already greater that cached solutions , we can prune.)

What is the method of estimation here that is genuinely faster to compute?

The rumor I have heard is that you perform Minimum-Spanning Tree , MST to obtain a lower-bound estimate. But I cannot see how this speeds up execution. An MST would seemingly process every edge in the subtree (while building a heap or whatnot), and since we are considering each edge, we might as well calculate the cost while we are at it, obtaining an actual cost, instead of an estimate.

My question: Why does Minimum Spanning Tree act as a very fast method for lower bound estimation?

πŸ‘︎ 6
πŸ’¬︎
πŸ‘€︎ u/moschles
πŸ“…︎ Nov 28 2019
🚨︎ report

Please note that this site uses cookies to personalise content and adverts, to provide social media features, and to analyse web traffic. Click here for more information.