Status Updates From The Traveling Salesman Prob...
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) by
Status Updates Showing 1-6 of 6
Frank
is 21% done
Yet more hand waving!
I can see I'm going to have to build & exercise some of these algorithms. Then, if I'm not careful, I'll really get hooked. Maybe even end up furthering them.
— Sep 13, 2018 03:11AM
Add a comment
I can see I'm going to have to build & exercise some of these algorithms. Then, if I'm not careful, I'll really get hooked. Maybe even end up furthering them.
Frank
is 16% done
DA initially assumes a low level of mathematical sophistication. This suffices to explain the problem, and little else.
DA then moves on describing solution approaches, but, wants to avoid a heap of details. So he waves his hands about and tries to paste over gaps by listing hundreds of journal article references. But how likely is the casual reader to follow this up? And just who is his target reader?
— Sep 12, 2018 03:08PM
Add a comment
DA then moves on describing solution approaches, but, wants to avoid a heap of details. So he waves his hands about and tries to paste over gaps by listing hundreds of journal article references. But how likely is the casual reader to follow this up? And just who is his target reader?
Frank
is 11% done
DA begins with an admirably broad viewpoint, even examining psychological studies to show the significance of design sense in arriving at good, intuitive solutions.
TSP's role as a paradigm case for complexity theory is treated.
I'm a bit concerned that DA sets out to present the user requirements for a software suite. This can limit its shelf life.
DA is suitable for anyone with modest mathematical background.
— Sep 07, 2018 07:57AM
Add a comment
TSP's role as a paradigm case for complexity theory is treated.
I'm a bit concerned that DA sets out to present the user requirements for a software suite. This can limit its shelf life.
DA is suitable for anyone with modest mathematical background.
