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

DOI10.1016/S0166-218X(97)00089-9zbMATH Open0901.05027MaRDI QIDQ1383387FDOQ1383387

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

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

zbMATH Keywords

M-convex functionvaluated matroidssubmodular systembase polyhedra

Mathematics Subject Classification ID

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

Cites Work

• Submodular functions and optimization.
• Valuated matroids
• Convexity and Steinitz's exchange property
• Title not available (Why is that?)
• Valuated matroids: A new look at the greedy algorithm
• Valuated Matroid Intersection I: Optimality Criteria
• Submodular flow problem with a nonseparable cost function

Cited In (4)

• Induction of M-convex functions by linking systems
• Shortest bibranchings and valuated matroid intersection
• On basic operations related to network induction of discrete convex functions
• Title not available (Why is that?)

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)