A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints.

Saved in:
Bibliographic Details
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.
Be the first to leave a comment!
You must be logged in first