The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
12 views

please help me to identify the state of the art algorithms in depth first branch and bound

i am thinking of undertaking a research project in constraint optimization. the problem is a combinatorial search in a tree with a fixed goal depth. among the approaches that i am considering is depth ...
1
vote
1answer
64 views

Traveling Salesman: how to use a lower bound?

Let me preface this question by giving some helpful background material. I'm trying to solve the traveling salesman problem using branch and bound. Concretely, for a partial solution, I'm using the ...
2
votes
0answers
71 views

Trying to understand the Gilmore-Lawler lower bound

For a class project we're developing a software that solves a common optimisation problem. After some research we've found out that our problem is called QAP (Quadratic Asssignment Problem) and the ...
4
votes
3answers
263 views

What is the difference between bounding and pruning in branch-and-bound algorithms?

Could anybody please explain what the difference between "bounding" and "pruning" in branch and bound algorithms is? I'd also appreciate references (preferably books), where this distinction is made ...
8
votes
2answers
2k views

Branch and Bound explanation

I have a test about the branch and bound algorithm. I understand theoretically how this algorithm works but I couldn't find examples that illustrates how this algorithm can be implemented practically. ...