Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modelling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference35 articles.
1. Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of Large-Scale Minimum Bisection Problems. Ph.D. thesis, Technische Universitt Chemnitz (2007)
2. Armbruster, M., Fgenschuh, M., Helmberg, C., Martin, A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Proceedings ofthe Conference on Integer Programming and Combinatorial Optimization (IPCO), LNCS, vol. 5035, pp. 112–124, (2008)
3. Bazgan, C., Karpinski, M.: On the complexity of global constraint satisfaction. In: Proceeding of 16th Annual International Symposium on Algorithms and Computation, vol. LNCS 3827, Springer, pp. 624–633 (2005)
4. Bazgan, C.: Paradigms of Combinatorial Optimization: Problems and New Approaches. In: Paschos, V.T. (ed) (Chapter 1: Optimal satisfiability), vol. 2, p. 25, Wiley-ISTE, (2010)
5. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献