Seiji Kataoka - Concepedia

Author

Seiji Kataoka

National Defense Academy of Japan

Also Known As

S. KATAOKA, S. Kataoka, SEIJI KATAOKA, Seiji Kataoka

Publications

383

Citations

H-Index

Concepts

All Affiliations

National Defense Academy of Japan Waseda University National Defence Academy

About

Seiji Kataoka is an author at National Defense Academy of Japan specializing in mathematical programming, combinatorial optimization, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	331
2	Computer Science	7	7	242
3	Logistics	3	3	189
4	Business	2	2	160
5	Education	2	2	38

Seiji Kataoka

Publications

355

Citations

H-Index

Page 1

	Year	Citations
Heuristic and Exact Algorithms for the Disjunctively Constrained Knapsack Problem Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe Transactions of Information Processing Society of Japan Mathematical ProgrammingEngineeringLagrangian RelaxationExact AlgorithmsDiscrete Optimization	2002	85
AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM Seiji Kataoka, Susumu Morito Journal of the Operations Research Society of Japan Mathematical ProgrammingEngineeringNetwork AnalysisComputational ComplexityAssignment Problem	1988	75
Some exact algorithms for the knapsack sharing problem Takeo Yamada, Mayumi Futakawa, Seiji Kataoka European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationKnapsack Sharing ProblemCombinatorial Problem	1998	34
Upper and lower bounding procedures for the multiple knapsack assignment problem Seiji Kataoka, Takeo Yamada European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationOptimization ProblemKnapsack Problem	2014	29
Heuristic and exact algorithms for the max–min optimization of the multi-scenario knapsack problem Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka Computers & Operations Research Mathematical ProgrammingEngineeringInteger OptimizationScheduling ProblemOptimization Problem	2006	26
A heuristic algorithm for the mini-max spanning forest problem Takeo Yamada, Hideo Takahashi, Seiji Kataoka European Journal of Operational Research Mathematical ProgrammingEngineeringGraph TheoryHeuristic AlgorithmCombinatorial Problem	1996	22
Listing all the minimum spanning trees in an undirected graph Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe International Journal of Computer Mathematics Mathematical ProgrammingEngineeringPlanar GraphNetwork AnalysisEducation	2010	22
On some LP problems for performance evaluation of timed marked graphs Takeo Yamada, Seiji Kataoka IEEE Transactions on Automatic Control Mathematical ProgrammingEngineeringPlanar GraphNetwork AnalysisEducation	1994	16
Algorithms to solve the knapsack constrained maximum spanning tree problem Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka International Journal of Computer Mathematics	2004	14
A branch-and-bound algorithm for the mini-max spanning forest problem Takeo Yamada, Hideo Takahashi, Seiji Kataoka European Journal of Operational Research Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringGraph TheoryOptimization Problem	1997	12

Page 1