Umetani Shunji

Shunji Umetani

Information about the author Shunji Umetani will soon be added to the site.
Found 5 papers in total
On the one‐dimensional stock cutting problem in the paper tube industry
On the one‐dimensional stock cutting problem in the paper tube industry
2011
The one‐dimensional cutting stock problem (1D‐CSP) is one of the...
Relaxation heuristics for the set covering problem
Relaxation heuristics for the set covering problem
2007
The set covering problem (SCP) is one of representative combinatorial optimization...
One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming
One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming
2006
One-dimensional cutting stock problem (1D-CSP) is one of the representative...
One-dimensional cutting stock problem to minimize the number of different patterns
One-dimensional cutting stock problem to minimize the number of different patterns
2003
As the cost associated with the change of cutting patterns become more important in...
A neural network parallel algorithm for minimum maximal matching problems
A neural network parallel algorithm for minimum maximal matching problems
1998
For a given graph G ( V, E ), a subset M of E is called a maximal matching of G if no...
Papers per page: