The resource allocation problem seeks to find an optimal allocation of a fixed amount of
resources to activities so as to minimize the cost incurred by the allocation. A simplest form …

It has widely been recognized that submodular functions play essential roles in efficiently
solvable combinatorial optimization problems. Since the publication of the 1st edition of this …

A theory of “discrete convex analysis” is developed for integer-valued functions defined on
integer lattice points. The theory parallels the ordinary convex analysis, covering discrete …

This study examined the effect of a technology-enriched classroom on student development
of higher-order thinking skills and student attitudes toward computers. A sample of 80 sixth …

Interplay between matrix theory and matroid theory is the main theme of this book, which
offers a matroid-theoretic approach to linear algebra and, reciprocally, a linear-algebraic …

The concept of M-convex function, introduced by Murota (1996), is a quantitative
generalization of the set of integral points in an integral base polyhedron as well as an …

Shared parking is recognized as a promising solution to tackle the parking space shortage
problem in population-dense cities. However, peer-to-peer shared parking by individuals is …

The concepts of L-convex function and M-convex function have recently been introduced by
Murota as generalizations of submodular function and base polyhedron, respectively, and …

The concept of M-convex functions plays a central role in “discrete convex analysis”, a
unified framework of discrete optimization recently developed by Murota and others. This …

This paper investigates the complexity of steepest descent algorithms for two classes of
discrete convex functions: M-convex functions and L-convex functions. Simple tie-breaking …