A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Year of publication: |
1997
|
---|---|
Authors: | Fischetti, Matteo ; Toth, Paolo |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 43.1997, 11, p. 1520-1536
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | traveling salesman problem | branch-and-cut algorithms | separation | computational analysis |
-
On the hop-constrained survivable network design problem with reliable edges
Botton, Quentin, (2014)
-
Modeling and solving the angular constrained minimum spanning tree problem
Cunha, Alexandre Salles da, (2019)
-
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
Fischetti, Matteo, (2020)
- More ...
-
Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
Dell'Amico, Mauro, (1993)
-
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Fischetti, Matteo, (2001)
-
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Fischetti, Matteo, (2001)
- More ...