Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations-Reference-Cited by-同舟云学术

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Published:2008-07-22 Issue:2 Volume:121 Page:307-335
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Rendl Franz,Rinaldi Giovanni,Wiegele Angelika

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-008-0235-8.pdf

Reference44 articles.

1. Achterberg, T.: Constraint integer programming. PhD thesis, Technische Universität Berlin. http://opus.kobv.de/tuberlin/volltexte/2007/1611/ (2007)

2. Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42–54 (2005)

3. Armbruster, M.: Branch-and-Cut for a semidefinite relaxation of the minimum bisection problem. PhD thesis, University of Technology Chemnitz (2007)

4. Barahona F., Ladányi L.: Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. RAIRO Oper. Res. 40(1), 53–73 (2006)

5. Barahona F., Mahjoub A.R.: On the cut polytope. Math. Program. 36(2), 157–173 (1986)

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

1. On some features of quadratic unconstrained binary optimization with random coefficients;Bollettino dell'Unione Matematica Italiana;2024-08-22

2. A Random Copositive Matrix Is Completely Positive with Positive Probability;SIAM Journal on Applied Algebra and Geometry;2024-08-19

3. A large population island framework for the unconstrained binary quadratic problem;Computers & Operations Research;2024-08

4. Performance of quantum annealing inspired algorithms for combinatorial optimization problems;Communications Physics;2024-07-19

5. A Mixed-Signal Compute-in-Memory Architecture for Solving All-to-All Connected MAXCUT Problems with Sub-µs Time-to-Solution;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19