A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OGDF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076617322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of Partition Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating from the dominant of the spanning tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research. Deterministic models and methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Optimization Algorithms in Physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical performance of efficient minimum cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank

Latest revision as of 22:31, 2 July 2024

scientific article
Language Label Description Also known as
English
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
scientific article

    Statements

    A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (English)
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    optimum attack problem
    0 references
    submodular function minimization
    0 references
    Potts glass with many states
    0 references

    Identifiers