Tetsuo Ichimori - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2011

On rounding off quotas to the nearest integers in the problem of apportionmentTetsuo Ichimori. jsiaml, 3:21-24, 2011. [doi]

2010

New apportionment methods and their quota propertyTetsuo Ichimori. jsiaml, 2:33-36, 2010. [doi]

2006

On ability of orthogonal genetic algorithms for the mixed chinese postman problemHiroshi Masuyama, Tetsuo Ichimori, Toshihiko Sasama. ICSOFT 2006: 39-46

2005

One-to-all and all-to-all broadcasting algorithms in cellular networksHiroshi Masuyama, Yuuta Fukudome, Tetsuo Ichimori. icete 2005: 142-145

1991

A two-commodity sharing problem on networksTetsuo Ichimori, Naoki Katoh. networks, 21(5):547-563, 1991. [doi]

1989

Tolerance of Double-Loop Computer Networks to Multinode FailuresHiroshi Masuyama, Tetsuo Ichimori. TC, 38(5):738-741, 1989.

1988

The Fair Resource Allocation Problem with Submodular ConstraintsSatoru Fujishige, Naoki Katoh, Tetsuo Ichimori. mor, 13(1):164-173, 1988. [doi]

1986

A new method of software structural testing by path analysisHiroshi Masuyama, Tetsuo Ichimori. scjapan, 17(4):34-42, 1986. [doi]

1985

Note on a Rectilinear Distance Round-Trip Location ProblemTetsuo Ichimori, Toshio Nishida. transci, 19(1):84-91, 1985. [doi]

A Two-Resource Allocation Problem Solvable in Linear TimeNimrod Megiddo, Tetsuo Ichimori. mor, 10(1):7-16, 1985. [doi]

1984

Technical Note - On Min-Max Integer Allocation ProblemsTetsuo Ichimori. ior, 32(2):449-450, 1984. [doi]

1983

Two routing problems with the limitation of fuelTetsuo Ichimori, Hiroaki Ishii, Toshio Nishida. DAM, 6(1):85-89, 1983. [doi]

1982

Optimal sharingTetsuo Ichimori, Hiroaki Ishii, Toshio Nishida. mp, 23(1):341-348, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL