MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
Year of publication: |
2020
|
---|---|
Authors: | Andrade, Rafael Castro de ; Saraiva, Rommel Dias |
Published in: |
Operations research and systems : XVIII Latin-Iberian-American conference on operations research, Claio 2016. - New York, NY, USA : Springer. - 2020, p. 147-172
|
Subject: | Shortest path in the presence of negative cycles | Compact primal-dual model | Combinatorial branch-and-bound | Cutting-plane | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Characterization of the split closure via geometric lifting
Basu, Amitabh, (2015)
-
Directed fixed charge multicommodity network design : a cutting plane approach using polar duality
Agarwal, Y. K., (2022)
-
Exact algorithms for the minimum cost vertex blocker clique problem
Nasirian, Farzaneh, (2019)
- More ...
-
Valid inequalities for the k-Color Shortest Path Problem
Andrade, Rafael Castro de, (2024)
-
Constrained shortest path tour problem : models, valid inequalities, and Lagrangian heuristics
Saraiva, Rommel Dias, (2020)
-
New formulations for the elementary shortest-path problem visiting a given set of nodes
Andrade, Rafael Castro de, (2016)
- More ...