The following pages link to Takeo Yamada (Q531432):
Displaying 46 items.
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- Generic properties of column-structured matrices (Q1057344) (← links)
- 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)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- A remark on the regularity of the coefficient matrix appearing in the charge simulation method (Q1433505) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- Finding all the negative cycles in a directed graph (Q1602697) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← 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)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- A mathematical programming approach to the construction of BIBDs (Q2995501) (← links)
- Listing all the minimum spanning trees in an undirected graph (Q3066964) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- A note on sign-solvability of linear system of equations (Q3211356) (← links)
- Controllability and the theory of economic policy: a structural approach (Q3476551) (← links)
- A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey (Q3487193) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
- A sufficient condition for structural decouplability of linear nonsquare systems (Q3682310) (← links)
- Algorithms to verify generic causality and controllability of descriptor systems (Q3690672) (← links)
- QUALITATIVE PROPERTIES OF SYSTEMS OF LINEAR CONSTRAINTS (Q3705219) (← links)
- Generic Matrix Sign-Stability (Q3731634) (← links)
- A network flow algorithm to find an elementary I/O matching (Q3783058) (← links)
- (Q3852074) (← links)
- Performance evaluation of marked graphs by linear programming (Q3982050) (← links)
- Identifiability of a simultaneous equations model of economy: a structural view (Q3986100) (← links)
- (Q3988331) (← links)
- (Q4170630) (← links)
- (Q4187674) (← links)
- (Q4274487) (← links)
- On some LP problems for performance evaluation of timed marked graphs (Q4306743) (← links)
- Reproducing Kernels of<i>H<sup>m</sup></i>(<i>a, b</i>) (<i>m</i>= 1, 2, 3) and Least Constants in Sobolev’s Inequalities (Q4459847) (← links)
- AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM (Q4649882) (← links)
- Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307) (← links)
- (Q4668779) (← links)
- A network flow approach to a city emergency evacuation planning (Q4717403) (← links)
- A resource allocation problem on timed marked graphs: a decomposition approach (Q4883825) (← links)
- Generic controllability theorems for descriptor systems (Q5187142) (← links)
- DP-BASED ALGORITHM AND FPTAS FOR THE KNAPSACK SHARING AND RELATED PROBLEMS (Q5232595) (← links)
