Author:
Çela Eranda,Punnen Abraham P.
Publisher
Springer International Publishing
Reference91 articles.
1. A.A. Ageev, A.V. Keĺmanov, A.V. Pyatkin, NP-hardness of the Euclidean max-cut problem. Dokl. Math. 89, 343–345 (2014)
2. V. Alekseev, The effect of local constraints on the complexity of determination of the graph independence number. Combin. Algebraic Methods Appl. Math., 3–13 (1982) (in Russian)
3. K. Allemand, K. Fukuda, T. Liebling, E. Steiner, A polynomial case of unconstrained zero-one quadratic optimization. Math. Program. 91, 49–52 (2001)
4. J.C. Anglés, D’ Auric, M. Preissmann, A, Sebó, Optimal cuts in graphs and statistical mechanics. Math. Comput. Model. 26, 1–11 (1997)
5. T. Badics, E. Boros, Minimization of half-products. Math. Oper. Res. 23, 649–660 (1998)