A note on computational aspects of the Steiner traveling salesman problem
Year of publication: |
2018
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Sinnl, Markus |
Published in: |
International Transactions in Operational Research. - Wiley, ISSN 0969-6016, ZDB-ID 2019815-2. - Vol. 26.2018, 4 (05.09.), p. 1396-1401
|
Publisher: |
Wiley |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Álvarez-Miranda, Eduardo, (2017)
-
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Álvarez-Miranda, Eduardo, (2017)
-
Álvarez-Miranda, Eduardo, (2017)
- More ...