Loading
[email protected] 01952 271 318

Description

This Maths Factsheet will:

• Help you convert a practical problem into one you can solve using a network.
• Explain the nearest neighbour algorithm.
• Explain ‘greediness’ in using nearest neighbour.
• Teach you how to find an upper bound using nearest neighbour.
• Teach you how to find a lower bound using node deletion and a minimum spanning tree on the nodes that are left.

Download Type

.PDF (pdf) 175.483 KB

Publication Date

January 2010

ISSN / ISBN

ISSN: 1351-5136

Copyright Disclaimer

The materials published on this website are protected by the Copyright Act of 1988. No part of our online resources may be reproduced or reused for any commercial purpose, or transmitted, in any other form or by any other means, without the prior permission of Curriculum Press Ltd.

Preview
D01 The Travelling Salesperson Problem

Similar Resources

What our customers say

Find exactly what you’re looking for.

Newsletter
Keep up to date with all the latest news, resources & updates from Curriculum Press