Resource allocation problems

N Katoh, T Ibaraki - Handbook of Combinatorial Optimization: Volume1–3, 1998 - Springer
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 …

A Min--Max Theorem for Bisubmodular Polyhedra

S Fujishige - SIAM Journal on Discrete Mathematics, 1997 - SIAM
For a family \calF⊆3^E closed with respect to the reduced union and intersection and for a
bisubmodular function f:\calF→\bfR with (∅,∅)∈\calF and f(∅,∅)=0, the bisubmodular …

A greedy algorithm for minimizing a separable convex function over a finite jump system

K Ando, S Fujishige, T Naitoh - … of the Operations Research Society of …, 1995 - jstage.jst.go.jp
(E,Jr), (ll],-) graphs(see[3, Il]we Page 1 The Operations Research Society of Japan NII-Electronic
Library Service The OpeiationsReseaich Society of Japan Journalof the OpeTations Research …

Polynomial-time algorithms for linear and convex optimization on jump systems

A Shioura, K Tanaka - SIAM journal on discrete mathematics, 2007 - SIAM
The concept of a jump system, introduced by Bouchet and Cunningham [SIAM J. Discrete
Math., 8 (1995), pp. 17–32], is a set of integer points with a certain exchange property. In this …

Characterizations of the set of integer points in an integral bisubmodular polyhedron

Y Iwamasa - Discrete Mathematics, 2024 - Elsevier
In this note, we provide two characterizations of the set of integer points in an integral
bisubmodular polyhedron. Our characterizations do not require the assumption that a given …

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested

S Fujishige - Japan journal of industrial and applied mathematics, 2012 - Springer
The present article takes up some of the author's research activities in the field of
combinatorial and discrete optimization from 1975 till quite recently. It treats not only what …

[PS][PS] Bisubmodular polyhedra and bidirected graphs

K Ando - P1i. D. Thesis, University of Tsukuba …, 1996 - coconut.sys.eng.shizuoka.ac.jp
We consider a\well-behaved" class of polyhedra characterized by the validity of a simple
procedure called greedy algorithm for solving linear programming problems over them. FDJ …

Neighbor systems, jump systems, and bisubmodular polyhedra

A Shioura - SIAM Journal on Discrete Mathematics, 2012 - SIAM
The concept of neighbor system, introduced by Hartvigsen in 2010, is a set of integral
vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of …

Neighbor systems and the greedy algorithm

D Hartvigsen - SIAM Journal on Discrete Mathematics, 2010 - SIAM
A neighbor system, introduced in this paper, is a collection of integral vectors in R^n with
some special structure. Such collections (slightly) generalize jump systems, which, in turn …

The orthant non-interaction theorem for certain combinatorial polyhedra and its implications in the intersection and the Dilworth truncation of bisubmodular functions

S Fujishige, SB Patkar - Optimization, 1995 - Taylor & Francis
We show a theorem characterizing a class of polyhedra that are expressed by systems of
inequalities with {0,±1} coefficients and have no interaction between maximal faces in …