Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Recent questions and answers in Branch & Bound
Most popular tags
asymptotic-analysis
recurrence-relations
time-complexity
loops
asymptotic-notation
graph
dynamic-programming
greedy
substitution-method
analysis
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
exam
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Recent questions and answers in Branch & Bound
+1
vote
2
answers
Employee to project assignment reward problem
answered
Dec 16, 2023
in
Branch & Bound
by
iamphani
(
196
points)
0
votes
2
answers
You are given a Boolean formula involving variables X1, X2, ... Xn.
answered
Dec 16, 2023
in
Branch & Bound
by
iamphani
(
196
points)
branch
and
bound
0
votes
3
answers
Solve a set of inter-related recurrence relations
answered
Dec 16, 2023
in
Branch & Bound
by
sharath_2002
(
220
points)
recurrence-relations
asymptotic-analysis
0
votes
2
answers
How can we solve the 8 puzzle problem using Branch & Bound approach?
answered
Dec 10, 2023
in
Branch & Bound
by
SasmiP
AlgoMeister
(
584
points)
n-puzzle
a-star
+1
vote
2
answers
Given jobs, resources and cost matrix, what assignment minimizes the overall cost?
answered
Dec 9, 2023
in
Branch & Bound
by
Yiming
Active
(
292
points)
job-assignment
+1
vote
2
answers
The lower bound for the Traveling Salesman Problem
answered
May 1, 2019
in
Branch & Bound
by
Ruan XiangNing
AlgoMeister
(
948
points)
branchandbound
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...