↓ Skip to main content

The Traveling Salesman Problem and Its Variations

Overview of attention for book
Attention for Chapter 2: Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP
Altmetric Badge

Citations

dimensions_citation
260 Dimensions

Readers on

mendeley
12 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP
Chapter number 2
Book title
The Traveling Salesman Problem and Its Variations
Published by
Springer US, January 2007
DOI 10.1007/0-306-48213-4_2
Book ISBNs
978-0-387-44459-8, 978-0-306-48213-7
Authors

Denis Naddef

Editors

Gregory Gutin, Abraham P. Punnen

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Portugal 1 8%
Unknown 11 92%

Demographic breakdown

Readers by professional status Count As %
Lecturer > Senior Lecturer 3 25%
Student > Ph. D. Student 3 25%
Professor 1 8%
Student > Master 1 8%
Researcher 1 8%
Other 0 0%
Unknown 3 25%
Readers by discipline Count As %
Computer Science 5 42%
Engineering 1 8%
Unknown 6 50%