Search Results - subject:"Max cut problem"

Narrow search

On relaxations of the max k-cut problem formulations

Fakhimi, Ramin; Validi, Hamidreza; Hicks, Illya V.; … - In: Operations research letters 51 (2023) 5, pp. 521-527

Persistent link: https://www.econbiz.de/10014495881

Generalised 2-circulant inequalities for the max-cut problem

Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis - In: Operations research letters 50 (2022) 2, pp. 122-128

Persistent link: https://www.econbiz.de/10013192621

Theoretical and computational study of several linearisation techniques for binary quadratic problems

Furini, Fabio; Traversi, Emiliano - 2019

Persistent link: https://www.econbiz.de/10012109562

A note on the 2-circulant inequalities for the max-cut problem

Kaparis, Konstantinos; Letchford, Adam N. - In: Operations research letters 46 (2018) 4, pp. 443-447

Persistent link: https://www.econbiz.de/10011916167

A MAX-CUT formulation of 0/1 programs

Lasserre, Jean B. - In: Operations research letters 44 (2016) 2, pp. 158-164

Persistent link: https://www.econbiz.de/10011457255

A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM

XU, FENGMIN; XU, CHENGXIAN; REN, JIUQUAN - In: Asia-Pacific Journal of Operational Research (APJOR) 26 (2009) 04, pp. 445-456

A continuous approach using NCP function for approximating the solution of the max-cut problem is proposed. The max-cut … feasible direction method is combined with NCP function for solving max-cut problem, and similar idea can be generalized to … problem is relaxed into an equivalent nonlinearly constrained continuous optimization problem and a feasible direction method …

Persistent link: https://www.econbiz.de/10008490590