The following pages link to Seiji Kataoka (Q1278249):
Displayed 18 items.
- A heuristic algorithm for the mini-max spanning forest problem (Q1278250) (← links)
- A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- A remark on the regularity of the coefficient matrix appearing in the charge simulation method (Q1433505) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- Listing all the minimum spanning trees in an undirected graph (Q3066964) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM (Q3818144) (← links)
- Identifiability of a simultaneous equations model of economy: a structural view (Q3986100) (← links)
- SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES (Q4006123) (← links)
- (Q4274487) (← links)
- On some LP problems for performance evaluation of timed marked graphs (Q4306743) (← links)
- Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307) (← links)
- A resource allocation problem on timed marked graphs: a decomposition approach (Q4883825) (← links)
- DP-BASED ALGORITHM AND FPTAS FOR THE KNAPSACK SHARING AND RELATED PROBLEMS (Q5232595) (← links)