Equivalence of convex minimization problems over base polytopes (Q1926652): 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/s13160-012-0083-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088408727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The egalitarian solution and reduced game properties in convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Concept of Egalitarianism Under Participation Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A push-relabel framework for submodular function minimization and applications to parametric optimization / 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: Submodular systems and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921761 / 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: Submodular function minimization / 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: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549634 / 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: NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for line search in submodular polyhedra / 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: Q2934723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Latest revision as of 01:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Equivalence of convex minimization problems over base polytopes
scientific article

    Statements

    Equivalence of convex minimization problems over base polytopes (English)
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    convex optimization
    0 references
    submodular function
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers