Generalized multiple depot traveling salesmen problem : polyhedral study and exact algorithm
Year of publication: |
June 2016
|
---|---|
Authors: | Sundar, Kaarthik ; Rathinam, Sivakumar |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 70.2016, p. 39-55
|
Subject: | Generalized multiple depot traveling salesmen | Routing | Branch-and-cut | Polyhedral study | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A revisited branch-and-cut algorithm for large-scale orienteering problems
Kobeaga, Gorka, (2024)
-
A new formulation and a branch-and-cut algorithm for the set orienteering problem
Archetti, Claudia, (2024)
-
A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing
Arslan, Okan, (2019)
- More ...
-
Piecewise polyhedral formulations for a multilinear term
Sundar, Kaarthik, (2021)
-
Routing problem for Unmanned Aerial Vehicle Patrolling missions : a progressive hedging algorithm
Rajan, Sudarshan, (2022)
-
A branch-and-price algorithm for a team orienteering problem with fixed-wing drones
Sundar, Kaarthik, (2022)
- More ...