Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference21 articles.
1. Allemand K, Fukuda K, Liebling TM, Steiner E.(2001) A polynomial case of unconstrained zero-one quadratic optimization. Math Program 91:49–52
2. Battiti R, Bertossi A. (1999) Greedy, prohibition and reactive heuristics for graph partitioning. IEEE Trans Comput 48(4):361–385
3. Beasley JE.(1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. In: Technical report, Management School, Imperial College London
4. Billionnet A, Elloumi S, Plateau M-C. (2006) Quadratic convex reformulation: a computational study of the graph bisection problem. In: Technical report RC1003, Conservatoire National des Arts et Métiers
5. Boulle M. (2004) Compact mathematical formulation for graph partitioning. Optim Eng 5:315–333
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献