Estimation of distribution algorithm for the max-cut problem

DOI10.1007/978-3-642-38221-5_26MaRDI QIDQ4922169zbMATH OpenOpenAlexFDO

Authors Samuel de Sousa, Yll Haxhimusa, Walter G. Kropatsch

Publication date 28 May 2013

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38221-5_26

zbMATH Keywords

EDAgraph cutmax-cutsegmentation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies for image processing (68U10)

Recommendations

• A memetic algorithm for the max-cut problem
• New algorithms for the weighted maximum cut problem on graphs
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• Randomized heuristics for the Max-Cut problem
• A gradient-based randomised heuristic for the maximum cut problem

Cited in

(6)

• Greedy differencing edge-contraction heuristic for the max-cut problem
• NP-hardness of the Euclidean Max-Cut problem
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
• Complexity of the weighted max-cut in Euclidean space
• On 1-skeleton of the cut polytopes
• A family of spanning-tree formulations for the maximum cut problem

This page was built for publication: Estimation of distribution algorithm for the max-cut problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922169)