The b‐bibranching problem: TDI system, packing, and discrete convexity

DOI10.1002/net.22035arXiv1802.03235OpenAlexW3139101652MaRDI QIDQ6065852

Kenjiro Takazawa

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03235

zbMATH Keywords

combinatorial optimizationpackingM-convex submodular flowtotally dual integral linear system

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient scaling algorithm for the minimum weight bibranching problem
• Submodular flow problem with a nonseparable cost function
• An efficient algorithm for minimum-weight bibranching
• Simpler exchange axioms for M-concave functions on generalized polymatroids
• A capacity scaling algorithm for M-convex submodular flow
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Shortest bibranchings and valuated matroid intersection
• Relationship of two formulations for shortest bibranchings
• The \(b\)-branching problem in digraphs
• List supermodular coloring with shorter lists
• List supermodular coloring
• M-Convex Function on Generalized Polymatroid
• Min-max Relations for Directed Graphs
• Discrete Convex Analysis
• Packing rooted directed cuts in a weighted directed graph
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
• Optimal Matching Forests and Valuated Delta-Matroids
• Lectures on matroids
• Optimum branchings

This page was built for publication: The b‐bibranching problem: TDI system, packing, and discrete convexity