The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An efficient scaling algorithm for the minimum weight bibranching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rooted directed cuts in a weighted directed graph / 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: List supermodular coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(b\)-branching problem in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for minimum-weight bibranching / 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: Simpler exchange axioms for M-concave functions on generalized polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship of two formulations for shortest bibranchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737441 / 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: Shortest bibranchings and valuated matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Matching Forests and Valuated Delta-Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List supermodular coloring with shorter lists / rank
 
Normal rank

Revision as of 11:09, 21 August 2024

scientific article; zbMATH DE number 7775497
Language Label Description Also known as
English
The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity
scientific article; zbMATH DE number 7775497

    Statements

    The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (English)
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    combinatorial optimization
    0 references
    M-convex submodular flow
    0 references
    packing
    0 references
    totally dual integral linear system
    0 references

    Identifiers