Computing minimum cuts by randomized search heuristics

DOI10.1007/S00453-009-9370-8MaRDI QIDQ633832zbMATH OpenOpenAlexFDO

Authors F. Neumann, Joachim Reichel, Martin Skutella

Publication date 30 March 2011

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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)

Recommendations

• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• A new approach to the minimum cut problem
• scientific article; zbMATH DE number 742961
• Practical performance of efficient minimum cut algorithms
• Evolutionary computation in combinatorial optimization

Cites work

• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• Advances in metaheuristics for hard optimization
• Combinatorial optimization. Theory and algorithms.
• Computing minimum cuts by randomized search heuristics
• Evolutionary Computation in Combinatorial Optimization
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Introduction to algorithms
• Minimum spanning trees made easier via multi-objective optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the size of weights in randomized search heuristics
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• STACS 2005
• The Complexity of Multiterminal Cuts

Cited in

(13)

• Computing minimum cuts by randomized search heuristics
• On the effectiveness of immune inspired mutation operators in some discrete optimization problems
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• scientific article; zbMATH DE number 1783770 (Why is no real title available?)
• Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
• An $\NC$ Algorithm for Minimum Cuts
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
• Heuristic and exact methods for the cutting sequencing problem
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Fixed-parameter evolutionary algorithms and the vertex cover problem

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

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