In this lecture segment, backtracking is described as depth-first search, while branch and bound is described as breadth-first search. Backtracking goes down one branch to the next level before considering siblings, whereas branch and bound considers all alternatives at the current level first.
Conditions: Applied to a state-space tree for job sequencing.; The comparison is about exploration order, not about bounding rules or cost evaluation.
In this lecture segment, backtracking is described as depth-first search, while branch and bound is described as breadth-first search. Backtracking goes down one branch to the next level before considering siblings, whereas branch and bound considers all alternatives at the current level first.
Conditions: Applied to a state-space tree for job sequencing.; The comparison is about exploration order, not about bounding rules or cost evaluation.
A path from the root records the ordered partial sequence of chosen jobs. Following a route in the drawn tree corresponds to selecting the jobs along that route in order; for example, the route using J1 then J4 means doing job 1 and job 4 and not taking jobs 2 and 3 along that partial path.
Conditions: The tree is the job-sequencing state-space tree drawn on the board.; Each edge label indicates appending one job to the current partial sequence.
A path from the root records the ordered partial sequence of chosen jobs. Following a route in the drawn tree corresponds to selecting the jobs along that route in order; for example, the route using J1 then J4 means doing job 1 and job 4 and not taking jobs 2 and 3 along that partial path.
Conditions: The tree is the job-sequencing state-space tree drawn on the board.; Each edge label indicates appending one job to the current partial sequence.