Combinatorial optimization: papers from the DIMACS Special Year Page 1 DIMACS Series in
Discrete Mathematics and Theoretical Computer Science Volume 20 Combinatorial …

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 paper describes recent developments in discrete convex analysis. Particular emphasis
is laid on natural introduction of the classes of L-convex and M-convex functions in discrete …

We consider a two-stage planning problem where a fleet of snowplow trucks is divided
among a set of independent regions, each of which then designs routes for efficient snow …

We consider the problem of making a given (k− 1)-connected graph k-connected by adding
a minimum number of new edges, which we call the k-connectivity augmentation problem. In …

In this paper, we consider the problem of finding a maximum weight 2-matching containing
no cycle of a length of at most three in a weighted simple graph, which we call the weighted …

For an undirected graph and a fixed integer k, a 2-matching is said to be k-restricted if it has
no cycle of length k or less. The problem of finding a maximum cardinality k-restricted 2 …

The concept of jump system, introduced by Bouchet and Cunningham (1995), is a set of
integer points satisfying a certain exchange property. We consider the minimization of a …

A jump system, which is a set of integer lattice points with an exchange property, is an
extended concept of a matroid. Some combinatorial structures such as the degree …

For an undirected graph and a fixed integer k, a 2-matching is said to be C k-free if it has no
cycle of length k or less. The problem of finding a maximum cardinality C k-free 2-matching …