Matsui Tomomi

Tomomi Matsui

Information about the author Tomomi Matsui will soon be added to the site.
Found 18 papers in total
A linear time algorithm for the unbalanced Hitchcock transportation problem
A linear time algorithm for the unbalanced Hitchcock transportation problem
2016
The Hitchcock transportation problem is a special case of the minimum cost flow...
An approximation algorithm for the traveling tournament problem
An approximation algorithm for the traveling tournament problem
2012
This paper describes the traveling tournament problem, a well‐known benchmark...
An Improved Approximation Algorithm for the Traveling Tournament Problem
An Improved Approximation Algorithm for the Traveling Tournament Problem
2011
This paper describes the traveling tournament problem, a well‐known benchmark...
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
2010
This paper deals with a strategic issue in the stable marriage model with complete...
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
2008
In this paper, we propose a fully polynomial-time randomized approximation scheme...
Semidefinite programming based approaches to the break minimization problem
Semidefinite programming based approaches to the break minimization problem
2006
This paper considers the break minimization problem in sports timetabling. The problem...
A polynomial-time algorithm to find an equitable home–away assignment
A polynomial-time algorithm to find an equitable home–away assignment
2005
We propose a polynomial-time algorithm to find an equitable home–away assignment...
Linear time approximation algorithm for multicoloring lattic graphs with diagonals
Linear time approximation algorithm for multicoloring lattic graphs with diagonals
2004
Let P be a subset of 2-dimensional integer lattice points P =...
New approximation algorithms for MAX 2SAT and MAX DICUT
New approximation algorithms for MAX 2SAT and MAX DICUT
2003
We propose a 0.935-approximation algorithm for MAX 2SAT and a 0.863-approximation...
A survey of algorithms for calculating power indices of weighted majority games
A survey of algorithms for calculating power indices of weighted majority games
2000
For measuring an individual's voting power of a voting game, some power indices are...
A fast bipartite network flow algorithm for selective assembly
A fast bipartite network flow algorithm for selective assembly
1998
Bipartite network flow problems naturally arise in applications such as selective...
The minimum spanning tree problem on a planar graph
The minimum spanning tree problem on a planar graph
1995
Finding a spanning tree of minimum weight is one of the best known graph problems....
Is a given flow uncontrollable?
Is a given flow uncontrollable?
1996
An s-t flow in a directed network is called ‘uncontrollable’, when the...
Adjacency on combinatorial polyhedra
Adjacency on combinatorial polyhedra
1995
This paper shows some useful properties of the adjacency structures of a class of...
An inefficiency measurement method for management systems
An inefficiency measurement method for management systems
1994
This paper proposes a new method ‘Inverted Data Envelopment Analysis (Inverted...
An algorithm for fractional assignment problems
An algorithm for fractional assignment problems
1995
In this paper the authors propose a polynomial-time algorithm for fractional...
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Adjacency of the best and second best valued solutions in combinatorial optimization problems
1993
The authors say that a polytope satisfies the strong adjacency property if every best...
On the finiteness of the criss-cross method
On the finiteness of the criss-cross method
1991
In this short paper, the finiteness of the criss-cross method is proven by showing a...
Papers per page: