Computing minimum cuts by randomized search heuristics

DOI10.1007/s00453-009-9370-8zbMath1211.90263OpenAlexW1978984733MaRDI QIDQ633832

Joachim Reichel, Martin Skutella, Frank Neumann

Publication date: 30 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9370-8

zbMATH Keywords

multi-objective optimizationevolutionary algorithmsrandomized search heuristicsminimum \(s\)-\(t\)-cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization ⋮ Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ Computing minimum cuts by randomized search heuristics ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ Fixed-parameter evolutionary algorithms and the vertex cover problem ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Computing minimum cuts by randomized search heuristics
• Minimum spanning trees made easier via multi-objective optimization
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• Advances in metaheuristics for hard optimization
• The Complexity of Multiterminal Cuts
• On the size of weights in randomized search heuristics
• STACS 2005
• Evolutionary Computation in Combinatorial Optimization
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Computing minimum cuts by randomized search heuristics