A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
From MaRDI portal
Publication:975757
DOI10.1007/s10878-009-9208-yzbMath1220.90106OpenAlexW2076617322MaRDI QIDQ975757
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
Related Items (1)
Uses Software
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