Skip to main content

An algorithm for the traveling salesman problem | NiceBooksReads

NiceBooksReadsSTORIES BRING US TOGETHER

Discover Books What’s Being Read?UK booksellers World Literature News Book Friendship Book rooms Book Club Ebooks Audiobooks Creation Studios Experts

EnglishUS

LanguageCountry / market

Market controls currency, catalogue and payment options; it does not change your language.

NiceBooksReadsSTORIES BRING US TOGETHER

Language

EnglishUS

LanguageCountry / market

Market controls currency, catalogue and payment options; it does not change your language.

Explore NiceBooksReads

⌕Discover›▥Books›↗What’s Being Read?›↗UK booksellers›✦World Literature News›♡Book Friendship›◌Book rooms›▧Book Club›▤Ebooks›▶Audiobooks›✦Creation Studios›◇Experts›

← Back to library

Source and use notice

You are accessing this work through its Internet Archive source record. NiceBooksReads provides access to the source and a reading/listening interface.

Rights in the work and recording belong to their respective rights holders. Please review the source record’s licence, access and use conditions. This notice grants no additional use or republication rights.

Source record ↗Source terms of use ↗

An algorithm for the traveling salesman problem

English

An algorithm for the traveling salesman problem

John D. C Little

Bibliography: 1 leaf following leaf 26

Sign in with your free account to read, download EPUBs or listen.

Read online →EPUB ↓

Report a problem with this book

An algorithm for the traveling salesman problem

ProblemDetails (optional)

Digital editions

Selling

Find other editions →

NiceBooksReadsSTORIES BRING US TOGETHER

A creative community where stories are written, read, heard and shaped with professional publishing services.

Discover Books What’s Being Read?World Literature News

Privacy & cookies User agreement Distance sales agreement Cookie settings

●Secure connectionProtected with HTTPS and SSL/TLS encryption

Payment cards

VISAmastercardtroy

© 2026 NiceBooksReads · All rights reserved.