Estimation of Distribution Algorithm for the Max-Cut Problem

DOI10.1007/978-3-642-38221-5_26zbMath1382.68235OpenAlexW187510605MaRDI QIDQ4922169

Yll Haxhimusa, Samuel de Sousa, 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

EDAsegmentationmax-cutgraph cut

Mathematics Subject Classification ID

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

Related Items (4)

What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ NP-hardness of the Euclidean Max-Cut problem ⋮ Greedy differencing edge-contraction heuristic for the max-cut problem ⋮ Complexity of the weighted max-cut in Euclidean space

This page was built for publication: Estimation of Distribution Algorithm for the Max-Cut Problem