A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem-Reference-Cited by-同舟云学术

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

Published: Issue: Volume: Page:112-124
ISSN:
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Armbruster Michael,Fügenschuh Marzena,Helmberg Christoph,Martin Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-68891-4_8.pdf

Reference21 articles.

1. Achterberg, T.: Constraint integer programming. PhD-Thesis, PhD-Thesis, Technische Universität Berlin, Berlin (2007)

2. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: On the bisection cut polytope. Technical Report, Chemnitz/Darmstadt University of Technology (2007)

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

4. Conforti, M., Rao, M.R., Sassano, A.: The equipartition polytope I, II. Math. Prog. 49, 49–70 (1990)

5. de Souza, C.C.: The graph equipartition problem: Optimal solutions, extensions and applications. PhD-Thesis, Université Catholique de Louvain, Belgium (1993)

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

1. Memetic Algorithms for Spatial Partitioning Problems;ACM Transactions on Spatial Algorithms and Systems;2023-01-12

2. An overview of graph covering and partitioning;Discrete Mathematics;2022-08

3. Graphs in VLSI circuits and systems;Graphs in VLSI;2022-06-30

4. Prioritized Restreaming Algorithms for Balanced Graph Partitioning;Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining;2020-07-06

5. Quadratic Optimization Models and Convex Extensions on Permutation Matrix Set;Advances in Intelligent Systems and Computing IV;2019-11-02