Author:
Anjos Miguel F.,Liers Frauke,Pardella Gregor,Schmutzer Andreas
Publisher
Springer International Publishing
Reference32 articles.
1. Applegate, D., Bixby, R.E., Chvátal, V., Cook, W.J. et al.: TSP cuts which do not conform to the template paradigm. Comput. Comb. Optim. 2241, 261–303 (2001)
2. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Integer Programming and Combinatorial Optimization, IPCO’08, Bertinoro, pp. 112–124 (2008)
3. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4, 275–306 (2012)
4. Barahona, F., Grötschel, M., Mahjoub, A.R.: Facets of the bipartite subgraph polytope. Math. Oper. Res. 10(2), 340–358 (1985)
5. Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493–513 (1988)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献