Seiji Kataoka

Available identifiers

zbMath Open kataoka.seijiMaRDI QIDQ1278249

List of research outcomes

Publication	Date of Publication	Type
DP-BASED ALGORITHM AND FPTAS FOR THE KNAPSACK SHARING AND RELATED PROBLEMS	2019-09-12	Paper
Upper and lower bounding procedures for the multiple knapsack assignment problem	2015-02-04	Paper
Listing all the minimum spanning trees in an undirected graph	2011-01-20	Paper
A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem	2009-05-29	Paper
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem	2007-11-30	Paper
Algorithms to solve the knapsack constrained maximum spanning tree problem	2005-03-30	Paper
Heuristic and exact algorithms for the spanning tree detection problem	2004-11-12	Paper
A remark on the regularity of the coefficient matrix appearing in the charge simulation method	2004-06-18	Paper
Minimum directed 1-subtree relaxation for score orienteering problem	2001-02-22	Paper
Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem	2000-08-30	Paper
A heuristic algorithm for the mini-max spanning forest problem	1999-04-27	Paper
A branch-and-bound algorithm for the mini-max spanning forest problem	1999-04-27	Paper
A resource allocation problem on timed marked graphs: a decomposition approach	1996-11-07	Paper
On some LP problems for performance evaluation of timed marked graphs	1994-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q4274487	1994-01-06	Paper
SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES	1992-09-26	Paper
Identifiability of a simultaneous equations model of economy: a structural view	1992-06-27	Paper
AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM	1988-01-01	Paper

Research outcomes over time

This page was built for person: Seiji Kataoka