Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Ehrhart clutters: regularity and max-flow min-cut.
Eigenspace of a circulant max–min matrix
The eigenproblem of a circulant matrix in max-min algebra is investigated. Complete characterization of the eigenspace structure of a circulant matrix is given by describing all possible types of eigenvectors in detail.
Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems
In this paper, which is an extension of [4], we first show the existence of solutions to a class of Min Sup problems with linked constraints, which satisfy a certain property. Then, we apply our result to a class of weak nonlinear bilevel problems. Furthermore, for such a class of bilevel problems, we give a relationship with appropriate d.c. problems concerning the existence of solutions.