We present a greedy algorithm for minimizing a separable convex function over a finite jump system (E,F), where E is a noBempty finite set amd lr is a nonempty finite set of integral points in ZE satisfying a certain exchange axiom. The concept ofjump system was introduced by A. Bouchet and W. H. Cunningham. A jump system is a genera}ization of an integral bisubmodulam polyhedron, alt integral polymatroid, a

No abstract

Abstruct For a nonempty finite set V let 3V be the set of aLl the ordered pairs of diejoint subsets of V,i.e., 3V = {(X,Y) i X, Y g V, X n Y = e}. We define two operations, reduced union U and intersection n, on 3V as followsz for each (Xi,g)

No abstract

No abstract