Operations on M‐Convex Functions on Jump Systems
From MaRDI portal
Publication:5454265
DOI10.1137/060652841zbMath1144.90015OpenAlexW2043507681MaRDI QIDQ5454265
Ken'ichiro Tanaka, Yusuke Kobayashi, Kazuo Murota
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060652841
Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
Triangle-free 2-matchings and M-concave functions on jump systems ⋮ Optimal general factor problem and jump system intersection ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs ⋮ Recent Developments in Discrete Convex Analysis ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ Lorentzian polynomials ⋮ A note on M-convex functions on jump systems ⋮ Induction of M-convex functions by linking systems ⋮ Even factors, jump systems, and discrete convexity ⋮ A survey of fundamental operations on discrete convex functions of various kinds ⋮ On basic operations related to network induction of discrete convex functions
