Decreasing minimization on M-convex sets: algorithms and applications (Q2089795): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minconvex Factors of Prescribed Size in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on well-balanced orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Egalitarian Graph Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density decompositions of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Covering Supermodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures of polyhedra determined by submodular functions on crossing families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Newton's algorithm for parametric submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-matchings for bipartite graphs and load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for nonlinear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / 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: Q4247449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum semi-matching problem in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted matroid optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal flows in networks with multiple sources and sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for lexicographically optimal flows in multi-terminal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster strongly polynomial time algorithm for submodular function minimization / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Submodular Function on a Lattice / rank
 
Normal rank

Revision as of 14:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Decreasing minimization on M-convex sets: algorithms and applications
scientific article

    Statements

    Decreasing minimization on M-convex sets: algorithms and applications (English)
    0 references
    0 references
    0 references
    24 October 2022
    0 references
    network flows
    0 references
    resource allocation
    0 references
    graph orientation
    0 references
    decreasing minimization
    0 references
    M-convex set
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers