Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged branch-and-bound
1
votes
0
answers
1
branch and bound
What is branch and bound and how is it using queue datastructure
What is branch and bound and how is it using queue datastructure
A_i_$_h
580
views
A_i_$_h
asked
Oct 9, 2017
Algorithms
branch-and-bound
algorithm-design-technique
+
–
1
votes
0
answers
2
GATE CSE 1990 | Question: 12a
Consider the following instance of the $0 -1$ Knapsack problem: $\max\; 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$ Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20 X_{5} < 32$ and $X_{i}=0$ ... nodes in the tree in the order in which they are expanded and for each node show the bound on the partial solutions and the decision which leads to that node.
Consider the following instance of the $0 -1$ Knapsack problem:$\max\; 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20...
makhdoom ghaya
971
views
makhdoom ghaya
asked
Nov 25, 2016
Algorithms
gate1990
descriptive
algorithms
branch-and-bound
unsolved
+
–
3
votes
1
answer
3
UGC NET CSE | Junet 2015 | Part 3 | Question: 58
Which of the following statements is true for Branch-and-Bound search? Underestimates of remaining distance may cause deviation from optimal path Overestimates can't cause right path to be overlooked Dynamic programming principle can be used to discard redundant partial paths All of the above
Which of the following statements is true for Branch-and-Bound search?Underestimates of remaining distance may cause deviation from optimal pathOverestimates can't cause ...
go_editor
3.9k
views
go_editor
asked
Aug 1, 2016
Algorithms
ugcnetcse-june2015-paper3
algorithms
branch-and-bound
tree-search-algorithm
graph-search
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register