A constructive proof for the induction of M-convex functions through networks

DOI10.1016/S0166-218X(97)00089-9MaRDI QIDQ1383387zbMATH OpenFDO

Authors Akiyoshi Shioura

Publication date 26 November 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

base polyhedraM-convex functionsubmodular systemvaluated matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial optimization (90C27)

Recommendations

• Induction of M-convex functions by linking systems
• \(M\)-convex function on generalized polymatroid
• scientific article; zbMATH DE number 1322432
• Minimization of an M-convex function

Cites work

• Convexity and Steinitz's exchange property
• scientific article; zbMATH DE number 1303529 (Why is no real title available?)
• Submodular flow problem with a nonseparable cost function
• Submodular functions and optimization.
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated matroids
• Valuated matroids: A new look at the greedy algorithm

Cited in

(4)

• Shortest bibranchings and valuated matroid intersection
• scientific article; zbMATH DE number 1864546 (Why is no real title available?)
• On basic operations related to network induction of discrete convex functions
• Induction of M-convex functions by linking systems

This page was built for publication: A constructive proof for the induction of M-convex functions through networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383387)