Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems View on Open Library

Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems

by Bernd Jeromin

No reviews yet
First published: 1980 1 language
Subjects
Branch and bound algorithms Traveling-salesman problem

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Bernd Jeromin

Zur Lösung des Rundreiseproblems mittels dualer Aufgaben unter Verwendung des Steigungsalgorithmus von M.L. Fisher, W.D. Northup und J.F. Shapiro

Zur Lösung des Rundreiseproblems mittel...

You Might Also Like

More in Branch and bound alg...
Branch-and-bound strategies for dynamic programming

Branch-and-bound strategies for dynamic ...

Thomas L. Morin
Automatic verification of sequential infinite-state processes

Automatic verification of sequential inf...

Olaf Burkart
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program

Results of the synthesis of optimal netw...

Jay Culliney
Pruning and branching methods for designing optimal networks by the branch-and-bound method

Pruning and branching methods for design...

Tomoyasu Nakagawa
Branch and bound methods for combinatorial problems

Branch and bound methods for combinatori...

John D. C. Little
Optimizing binary trees grown with a sorting algorithm

Optimizing binary trees grown with a sor...

William A Martin