A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints.
Saved in:
| Title: | A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints. |
|---|---|
| Authors: | Taktak, Raouia1,2, raouia.taktak@isims.usf.tn |
| Source: | Annals of Operations Research; Aug2025, Vol. 351 Issue 1, p993-1021, 29p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 187092001 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Taktak%2C+Raouia%22">Taktak, Raouia</searchLink><relatesTo>1,2</relatesTo>, <i>raouia.taktak@isims.usf.tn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>; Aug2025, Vol. 351 Issue 1, p993-1021, 29p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=187092001 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10479-024-06003-7 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 29 StartPage: 993 Titles: – TitleFull: A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Taktak, Raouia IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 351 – Type: issue Value: 1 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |