On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms-Reference-Cited by-同舟云学术

On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms

Published:2021-08-03 Issue:1-2 Volume:305 Page:107-136
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Kobeaga Gorka^ORCID,Merino María,Lozano Jose A.

Funder

ministerio de ciencia e innovación

Ministerio de Economía y Competitividad

Eusko Jaurlaritza

euskal herriko unibertsitatea

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://link.springer.com/content/pdf/10.1007/s10479-021-04210-0.pdf

Reference30 articles.

1. Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2007). The traveling salesman problem: A computational study (Princeton series in applied mathematics). Princeton University Press.

2. Archetti, C., Speranza, M. G., & Vigo, D. (2014). Vehicle routing problems with profits. In Vehicle routing: Problems, methods, and applications, chapter 10 (pp. 273–297). MOS-SIAM Series on Optimization.

3. Bauer, P. (1997). The circuit polytope: Facets. Mathematics of Operations Research, 22(1), 110–145.

4. Bauer, P., Linderoth, J., & Savelsbergh, M. (2002). A branch and cut approach to the cardinality constrained circuit problem. Mathematical Programming, 91, 307–348.

5. Bérubé, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks, 54, 56–67.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Early Stopping in Evolutionary Direct Policy Search;ACM Transactions on Evolutionary Learning and Optimization;2024-07-29

2. A revisited branch-and-cut algorithm for large-scale orienteering problems;European Journal of Operational Research;2024-02