Open access peer-reviewed chapter

Privacy-Preserving Local Search for the Traveling Salesman Problem

By Jun Sakuma and Shigenobu Kobayashi

Submitted: April 12th 2010Published: December 30th 2010

DOI: 10.5772/12933

Downloaded: 1367

© 2010 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided the original is properly cited and derivative works building on this content are distributed under the same license.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Jun Sakuma and Shigenobu Kobayashi (December 30th 2010). Privacy-Preserving Local Search for the Traveling Salesman Problem, Traveling Salesman Problem, Theory and Applications, Donald Davendra, IntechOpen, DOI: 10.5772/12933. Available from:

chapter statistics

1367total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Chaos Driven Evolutionary Algorithm for the Traveling Salesman Problem

By Ivan Zelinka, Roman Senkerik, Magdalena Bialic-Davendra and Donald Davendra

Related Book

First chapter

Limit Properties of Evolutionary Algorithms

By Witold Kosiński, and Stefan Kotowski

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us