An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2023.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4315476327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linearizable instances of the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic minimum spanning tree problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Frank's generalized polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems with color-induced budget constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid optimization with the interleaving of two ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic M-convexity testing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling algorithm for M-convex submodular flow / 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: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on low rank nonconvex structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection II: Algorithms / 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: M-Convex Function on Generalized Polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic M-convex and L-convex functions / 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: Q3330974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 12:29, 1 August 2024

scientific article; zbMATH DE number 7703344
Language Label Description Also known as
English
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
scientific article; zbMATH DE number 7703344

    Statements

    An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (English)
    0 references
    0 references
    28 June 2023
    0 references
    matroid intersection
    0 references
    generalized polymatroid
    0 references
    nonseparable discrete convex function
    0 references
    polynomial algorithm
    0 references

    Identifiers