10 citations · 45 across the 35 of their papers we have counts for
5 papers · 1 filter
Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis
András Frank, Kazuo Murota
We continue to consider the discrete decreasing minimization problem on an integral base-polyhedron treated in Part I. The problem is to find a lexicographically minimal integral v…
Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization
András Frank, Kazuo Murota
Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly…
Integrality of Subgradients and Biconjugates of Integrally Convex Functions
Kazuo Murota, Akihisa Tamura
Integrally convex functions constitute a fundamental function class in discrete convex analysis. This paper shows that an integer-valued integrally convex function admits an integr…
On Fundamental Operations for Multimodular Functions
Satoko Moriguchi, Kazuo Murota
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete co…
A tractable class of binary VCSPs via M-convex intersection
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota +1
A binary VCSP is a general framework for the minimization problem of a function represented as the sum of unary and binary cost functions. An important line of VCSP research is to…