A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions

DOI10.1007/s10878-009-9208-yzbMath1220.90106OpenAlexW2076617322MaRDI QIDQ975757

Frauke Liers, Diana Fanghänel

Publication date: 11 June 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://e-archive.informatik.uni-koeln.de/574/2/zaik2008-574.pdf

zbMATH Keywords

submodular function minimizationoptimum attack problemPotts glass with many states

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

A bilevel programming problem with maximization of a supermodular function in the lower level

Uses Software

• OGDF

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Separating from the dominant of the spanning tree polytope
• Geometric algorithms and combinatorial optimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Practical performance of efficient minimum cut algorithms
• Submodular functions and optimization.
• Operations research. Deterministic models and methods.
• Separation of Partition Inequalities
• New Optimization Algorithms in Physics
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Optimal attack and reinforcement of a network
• A new approach to the maximum-flow problem
• Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states

This page was built for publication: A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions