Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut-Reference-Cited by-同舟云学术

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

Published:2006-01 Issue:1 Volume:40 Page:53-73
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Barahona Francisco,Ladányi László

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro:2006010/pdf

Reference38 articles.

1. An integer linear programming approach to the steiner problem in graphs

2. D. Applegate, R. Bixby, V. Chvátal and W. Cook, On the solution of traveling salesman problems, inProc. of the International Congress of MathematiciansIII(1998) 645–656.

3. The volume algorithm revisited: relation with bundle methods

4. Ground-state magnetization of Ising spin glasses

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

1. Partial Lasserre relaxation for sparse Max-Cut;Optimization and Engineering;2022-08-17

2. Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem;International Transactions in Operational Research;2021-08-03

3. Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results;Optimization Letters;2020-11-20

4. Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods;International Transactions in Operational Research;2020-01-28

5. A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem;European Journal of Operational Research;2019-05