During the execution of the B&B algorithm, many candidate problems are likely to be generated and awaiting

Question:

During the execution of the B&B algorithm, many candidate problems are likely to be generated and awaiting further analysis. In the B&B example in this chapter, we chose the next candidate problem to analyze in a rather arbitrary way. What other, more structured ways might we use to select the next candidate problem? What are the pros and cons of these techniques?