A capacity scaling algorithm for M-convex submodular flow (Q1777220): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-004-0562-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134750400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Algorithm for Submodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster capacity scaling algorithm for minimum cost submodular flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding feasible vectors of Edmonds-Giles polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for the intersection problem of submodular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for image segmentation, Markov random fields and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Convex Cost Closure Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling algorithm for convex cost submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Scaling Algorithm for Minimizing Submodular Functions / 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: Q4263717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity scaling algorithm for scalable M-convex submodular flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular flow problem with a nonseparable cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of M-convex submodular flow problem to mathematical economics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered Augmenting Path Algorithms / rank
 
Normal rank

Latest revision as of 10:27, 10 June 2024

scientific article
Language Label Description Also known as
English
A capacity scaling algorithm for M-convex submodular flow
scientific article

    Statements

    A capacity scaling algorithm for M-convex submodular flow (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2005
    0 references
    Discrete optimization
    0 references
    Discrete convex function
    0 references
    Submodular flow
    0 references
    Algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers