Name
Title | ||
|---|---|---|
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
Abstract | ||
|---|---|---|
•A linear integer programming formulation and valid inequalities for the PDTSPMS.•Separation methods and strategies to improve the performance of the branch-and-cut.•Branch-and-cut that includes the valid inequalities and strategies.•The branch-and-cut outperforms all the other existing algorithms for the PDTSPMS. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ejor.2021.07.051 | European Journal of Operational Research |
Keywords | DocType | Volume |
Combinatorial optimization,Branch-and-cut,Traveling salesman,Pickup and delivery,Multiple stacks | Journal | 300 |
Issue | ISSN | Citations |
1 | 0377-2217 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Armando Honorio Pereira | 1 | 0 | 0.34 |
| Geraldo Robson Mateus | 2 | 413 | 42.30 |
| Sebastián Alberto Urrutia | 3 | 0 | 0.34 |