A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem.
Saved in:
| Title: | A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem. |
|---|---|
| Authors: | Ostuni, Dario1, Righini, Giovanni1, giovanni.righini@unimi.it |
| Source: | Networks; Jan2026, Vol. 87 Issue 1, p39-46, 8p |
| Database: | Applied Science & Technology Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 189843576 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Ostuni%2C+Dario%22">Ostuni, Dario</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AU" term="%22Righini%2C+Giovanni%22">Righini, Giovanni</searchLink><relatesTo>1</relatesTo>, <i>giovanni.righini@unimi.it</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Networks%22">Networks</searchLink>; Jan2026, Vol. 87 Issue 1, p39-46, 8p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=189843576 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/net.70012 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 8 StartPage: 39 Titles: – TitleFull: A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ostuni, Dario – PersonEntity: Name: NameFull: Righini, Giovanni IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 00283045 Numbering: – Type: volume Value: 87 – Type: issue Value: 1 Titles: – TitleFull: Networks Type: main |
| ResultId | 1 |