Search Results - subject:"MaxCut"

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem

Habibi, Soodeh; Kočvara, Michal; Stingl, Michael - In: Journal of Global Optimization 93 (2025) 1, pp. 63-85

numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state …

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

On the instance dependence of parameter initialization for the quantum approximate optimization algorithm : insights via instance space analysis

Katial, Vivek; Smith-Miles, Kate; Hill, Charles; … - In: INFORMS journal on computing : JOC ; charting new … 37 (2025) 1, pp. 146-171

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

A branch-and-cut algorithm for the connected max-k-cut problem

Healy, Patrick; Jozefowiez, Nicolas; Laroche, Pierre; … - In: European journal of operational research : EJOR 312 (2024) 1, pp. 117-124

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

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

What works best when? : a systematic evaluation of heuristics for Max-Cut and QUBO

Dunning, Iain; Gupta, Swati; Silberholz, John - In: INFORMS journal on computing : JOC 30 (2018) 3, pp. 608-624

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

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

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Wang, Yang; Lü, Zhipeng; Glover, Fred; Hao, Jin-Kao - In: Computers & operations research : and their … 40 (2013) 12, pp. 3100-3107

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

Path relinking for unconstrained binary quadratic programming

Wang, Yang; Lü, Zhipeng; Glover, Fred; Hao, Jin-Kao - In: European Journal of Operational Research 223 (2012) 3, pp. 595-604

large random UBQP instances and 103 structured instances derived from the MaxCut problem. Comparisons with several state … MaxCut instances. …

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

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 … convergence of the algorithm is proved. Numerical experiments and comparisons on some max-cut test problems show that we can get … the satisfactory solution of max-cut problems with less computation time. Furthermore, this is the first time that the …

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