A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Padberg, Manfred W.; Rinaldi, Giovanni

doi:10.1137/1033004

Record: found
Abstract: not found
Article: not found

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Author(s): Manfred Padberg , Giovanni Rinaldi

Publication date Created: March 1991

Publication date (Print): March 1991

Journal: SIAM Review

Publisher: Society for Industrial & Applied Mathematics (SIAM)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: SIAM Review

Abbreviated Title: SIAM Rev.

Publisher: Society for Industrial & Applied Mathematics (SIAM)

ISSN (Print): 0036-1445

ISSN (Electronic): 1095-7200

Publication date Created: March 1991

Publication date (Print): March 1991

Volume: 33

Issue: 1

Pages: 60-100

Article

DOI: 10.1137/1033004

SO-VID: 3b9690cc-5357-4230-b1a3-5ee7c438f15e

History

Data availability:

Comments

Comment on this article

scite_

Cited by 113

See all cited by

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Read this article at

Related collections

HR-EBSD (High Resolution - Electron Back Scatter Diffraction)

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 753

Cited by 113