Publication

by Takeo Yamada

Recent Working Papers (Available on request)

  1. [NDA-CS-1102] You, B.-J., D. Yokoya and T. Yamada, "An improved reduction method for the robust optimization of the assignment problem", submitted to APJOR

Refereed Journal Articles (PDF copies available on request)

  1. [11-2] You, B.-J. and T. Yamada, "An exact algorithm for the budget-constrained multiple knapsack problem", to appear in International Journal of Computer Mathematics.

  2. [11-1] You, B.-J. and T. Yamada, "Shift-and-merge technique for the DP solution of the time-constrained backpacker problem", to appear in Computers & Operations Research.

  3. [10-3] Yokoya, D., C. W. Duin and T. Yamada, "A reduction approach to the repeated assignment problem", European J. of Operational Research, 210(2011), 185-193.

  4. [10-2] Yokoya, D. and T. Yamada, "A mathematical programming approach to the construction of BIBDs", International Journal of Computer Mathematics, 88(2011), 1067-1083.

  5. [10-1] Yamada, T, S. Kataoka and K. Watanabe, "Listing up all the minimum spanning trees in an undirected graph", International Journal of Computer Mathematics, 87 (2010), 3175-3185.

  6. [09-3] Yamada, T., "A mini-max spanning forest approach to the political districting problem", International Journal of Systems Science, 40 (2009), 471-477.

  7. [09-2] Taniguchi, F., T. Yamada and S. Kataoka, "A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem", International Journal of Computer Mathematics, 86 (2009), 779-793.

  8. [09-1] Yamada, T. and T. Takeoka, "An exact algorithm for the fixed-charge multiple knapsack problem", European Journal of Operational Research, 192 (2008), 700-705.

  9. [08-1] Taniguchi, F., T. Yamada and S. Kataoka, "Heuristic and exact algorithms for the max-min optimization of the multi-criteria knapsack problem", Computers & Operations Research, 35 (2008), 2034-2048.

  10. [07-1] You, B.-J. and T. Yamada, "A pegging approach to the precedence constrained knpasack problem", European J. Operational Research, 183 (2007), 618-632.

  11. [06-1] Fujimoto, M. and T. Yamada, "An algorithm for the knapsack sharing problem with common items," European Journal of Operational Research, 171 (2006), 693-707.

  12. [05-2] Yamada, T., K. Watanabe and S. Kataoka, "Algorithms to solve the knapsack constrained maximum spanning tree problem", Int. Journal of Computer Mathematics, 82 (2005), 23-34.

  13. [05-1] Yamada, T., S. Kataoka and K. Watanabe, "Heuristic and exact algorithms for the spanning tree detection problem", Computers & Operations Research, 32 (2005), 239-255.

  14. [03-1] Watanabe, K., T. Yamada and W. Takahashi, "Reproducing kernels of H^m(a,b) (m=1,2,3) and least constants in Sobolev's inequalities", Applicable Analysis, 82 (2003), 809-820.

  15. [02-3] Watanabe, K., T. Yamada and S. Kataoka, "A remark on the regularity of the coefficient matrix appearing in the charge simulation method", Japan J. Indust. Appl. Math., 20 (2002), 279-284.

  16. [02-2] Yamada, T., S. Kataoka and K. Watanabe, "Heuristic and exact algorithms for the disjunctively constrained knapsack problem", Information Processing Society of Japan Journal, Vol. 43, No. 9 (2002), 2864-2870.

  17. [02-1] Yamada, T. and H. Kinoshita, "Finding all the negative cycles in a directed graph," Discrete Applied Mathematics, 118 (2002), 279-291.

  18. [00-3] Samphaiboon N. and T. Yamada, "Heuristic and exact algorithms for the precedence constrained knapsack problem," J. Optimization Theory and Applications, 105 (2000), 659-676.

  19. [00-2] Yamada, T. and Y. Nasu, "Heuristic and exact algorithms for the simultaneous assignment problem," European Journal of Operational Research, 123 (2000), 531-542.

  20. [00-1] Kataoka, S., N. Araki and T. Yamada, "Upper and lower bounding procedures for minimum rootes k-subtree problem", European Journal of Operational Research, 122 (2000), 561-569.

  21. [98-2] Yamada, T., M. Futakawa and S. Kataoka, "Some exact algorithms for the knapsack sharing problem," European Journal of Operational Research, 106 (1998), 177-183.

  22. [98-1] Kataoka, S., T. Yamada and S. Morito, "Minimum directed 1-subtree relaxation for score orienteering problem," European Journal of Operational Research, 104(1998), 139-153.

  23. [97-2] Yamada, T., Takahashi, H. and S. Kataoka , "A branch-and-bound algorithm for the mini-max spanning forest problem," European Journal of Operational Research, 101 (1997), 93-103.

  24. [97-1] Yamada, T. and M. Futakawa, "Heuristic and reduction algorithms for the knapsack sharing problem," Computers & Operations Research, 24 (1997), 961-967.

  25. [96-3] Yamada, T., "A network flow approach to a city emergency evacuation planning," International Journal of Systems Science, 27(1996), 931-936.

  26. [96-2] Yamada, T., H. Takahashi and S. Kataoka, "A heuristic algorithm for the mini-max spanning forest problem," European Journal of Operational Research, 91 (1996), 565-572.

  27. [96-1] Shimohata, H., S. Kataoka and T. Yamada, "A resource allocation problem on timed marked graphs: a decomposition approach," International Journal of Systems Science, 27 (1996), 405-411.

  28. [94-4] Yamada, T., M. Ohkawa and S. Kataoka, "Some optimization problems for timed marked graphs," International Journal of Systems Science, 25 (1994), 2339-2348.

  29. [94-3] Yamada, T. and S. Kataoka, "On some LP problems for performance evaluation of timed marked graphs," IEEE Transactions on Automatic Control, 39 (1994), 696-698.

  30. [94-2] Ohkawa, M., S. Kataoka and T. Yamada, "Optimal synchronization of discrete event dynamic systems via timed marked graphs," International Journal of Systems Science, 25 (1994), 291-299.

  31. [94-1] Yamada, T., J. Yorozuya and S. Kataoka, "Enumerating extreme points of a highly degenerate polytope," Computers & Operations Research, 21 (1994), 397-410.

  32. [91-2] Yamada, T. and S. Kataoka, "Identifiability of a simultaneous equations model of economy: a structural view," International Journal of Systems Science, 22 (1991), 2663-2670.

  33. [91-1] Morioka, S. and T. Yamada, "Performance evaluation of marked graphs by linear programming," International Journal of Systems Science, 22 (1991), 1541-1552.

  34. [90-1] Yamada, T., "Controllability and the theory of economic policy: a structural view," International Journal of Systems Science, 21 (1990), 723-737.

  35. [89-1] Yamada, T., "Structural characterization of Tinbergen's theory of policy," International Journal of Policy and Information,13 (1989), 39-48.

  36. [88-2] Yamada, T., "A note on sign-solvability of linear systems of equations," Linear and Multilinear Algebra, 22 (1988), 313-323.

  37. [88-1] Yamada, T., "A network flow algorithm to find an elementary i/o matching," Networks, 18 (1988), 105-109.

  38. [87-1] Yamada, T., "Generic matrix sign-stability," Canadian Mathematical Bulletin, 30 (1987), 370-376.

  39. [85-5] Yamada, T. and T. Kitahara, "Qualitative properties of systems of linear constraints," Journal of the Operations Research Society of Japan, 28 (1985), 331-344.

  40. [85-4] Yamada, T. and T. Saga, "A sufficient condition for structural decouplability of linear non-square systems," IEEE Transactions on Automatic Control, AC-30 (1985), 918-920.

  41. [85-3] Yamada, T. and D. G. Luenberger, "Algorithms to verify generic causality and controllability of descriptor systems," IEEE Transactions on Automatic Control, AC-30 (1985), 874-880.

  42. [85-2] Yamada, T. and D. G. Luenberger, "Generic controllability theorems for descriptor systems," IEEE Transactions on Automatic Control, AC-30 (1985), 144-152. Outstanding Papaer Award winning paper! Details...

  43. [85-1] Yamada, T. and D. G. Luenberger, "Generic properties of column structured matrices," Linear Algebra and its Applications, 65 (1985), 189-206.

  44. [84-1] Yamada, T., "Comments on On structural controllability theorem'," IEEE Transactions on Automatic Control, AC-29 (1984), 1130-1131.

  45. [80-1] Yamada, T., "Comments on Two-level form of Kalman filter'," IEEE Transactions on Automatic Control, AC-25 (1980), 856-857.

  46. [77-1] Imamura, K. and T. Yamada, "Evaluation of the power of each prefecture by means of principal component analysis," Policy Analysis and Information Systems, 1 (1977), 59-77.

Refereed Review Articles

  1. [90-1R] Yamada, T. and L. R. Foulds, "Graph-theoretic approach to investigate structural and qualitative properties of systems: a review article," Networks, 20 (1990), 427-452.

  2. [86-1R] Yamada, T., "Structural and qualitative properties of systems: a graph-theoretic approach," Journal of the Operations Research Society of Japan, 29 (1986), 376-399 (in Japanese).

Refereed Conference Papers (Book Chapters. PDF available on request)

  1. [10-1P] Yokoya, D., T. Yamada, "Approximation Algorithms for the Multiply Constrained Assignment Problem", in: X.-S. Zhang, D.-G. Liu, L.-Y. Wu, Y. Wang (eds.), Lecture Notes in Operations Research 12, World Publ. Co., Beijin, 152-159, 2010. (Presented at ISORA 2010, Aug. 19-23, Chengdu, China)

  2. [10-2P] You, B.-J., T. Yamada, "Shift-and-Merge Technique for the DP Solution of the Backpacker Problem", in: X.-S. Zhang, D.-G. Liu, L.-Y. Wu, Y. Wang (eds.), Lecture Notes in Operations Research 12, World Publ. Co., Beijin, 144-151, 2010. (Presented at ISORA 2010, Aug. 19-23, Chengdu, China)

  3. [09-1P] Yokoya, D. and T. Yamada, "A Tabu Search Algorithm to Construct BIBDs Using MIP Solvers", in: D.-Z. Du and X.-S. Zhang (eds.), Lecture Notes in Operations Research 10, World Publ. Co., Beijin, 179-189, 2009. (Presented at ISORA 2009, Sept. 20-22, Zhanjiajie, Hunan, China)

  4. [09-2P] Yokoya, D. and T. Yamada, "Solution of Large-scale LP Problems Using MIP Solvers: Repeated Assignment Problem", in: D.-Z. Du and X.-S. Zhang (eds.), Lecture Notes in Operations Research 10, World Publ. Co., Beijin, 190-197, 2009. (Presentation at ISORA 2009, Sept. 20-22, Zhanjiajie, Hunan, China)

  5. [08-1P] You, B.-J. and T. Yamada, "Heuristic Algorithms for the Fixed-Charge Multiple Knapsack Problem", in: X.-S. Zhang, D.-G. Liu and Y. Wang (eds.), Lecture Notes in Operations Research 8, World Publ. Co., Beijin, 207-218, 2008. (Presentation at ISORA 2008, Oct. 31-Nov. 2, Lijiang, Yunnan, China)

  6. [06-2P] V. Nomsiri and T. Yamada, "An improved algorithm for the bilateral assignment broblem", in: X.-S. Zhang, D.-G. Liu and L.-Y. Wu (eds.), Lecture Notes in Operations Research 6, World Publ. Co., Beijin, 118-127, 2006. (Presented at ISORA 2006, Aug. 8-11, Urmuqi, China)

  7. [05-3P] Senisuka, A., B.-J. You and T. Yamada, "Reduction and exact algorithms for the disjuntively constrained knapsack problem," in: X.-S. Zhang, D.-G. Liu and L.-Y. Wu (eds.), Lecture Notes in Operations Research 5, World Publ. Co., Beijin, 241-254, 2005. (Presentd at ISORA 2005, Aug. 8-13, Rhasa, China)

  8. [02-4P] Yamada, T., "Max-min optimization of the multiple knapsack problem: an implicit enumeration approach", in: E. Kozan, A. Ohuchi (eds.), Operations Research/Management Science at Work: Applying Theory in the Asia Pacific Region, Kluwer Academic Publishers, 351-362, 2002.

  9. [90-2P] Yamada, T., "A correlation method for leakage detection and location in a water distribution network," in: B.-H. Ahn (ed.), Asian-Pacific Operations Research: APORS'88, Elsevier (North-Holland), 693-705, 1990.

Other Publications (PDF available on request)

  1. [11-1X] B.-J. You, T. Yamada, "Shift-and-merge technique for the DP solution of the time-constrained backpacker problem," RIMS Kokyuroku 1734 (Decision Making Problems under Uncertainty), pp. 93-100, 2011 (April).

  2. [11-2X] Yokoya, D. and T. Yamada, "Two pegging tests for the multiplly constrained assignment problem" (in Japanese), RIMS Kokyuroku 1734 (Decision Making Problems under Uncertainty), pp. 85-92, 2011 (April).

  3. [10-1X] Yokoya, D. and T. Yamada, "Search for BIBDs using MIP solvers" (in Japanese), Optimization: Modeling and Algorithms 23, The Institute of Statistical Mathematics Cooperative Research Report, pp. 28-42, 2010.

  4. [10-2X] B.-J. You, T. Yamada, "An exact algorithm for the budget-constrained multiple knapsack problem, RIMS Kokyuroku 1682 (Decision Making and Mathematical Models under Uncertainty), pp. 168-173, 2010 (April).

  5. [10-3X] Yokoya, D. and T. Yamada, "A reduction approach to the repeated assignment problem" (in Japanese), RIMS Kokyuroku 1682 (Decision Making and Mathematical Models under Uncertainty), pp. 176-183, 2010 (April).

  6. [09-1X] Yokoya, D. and T. Yamada, "Construction of BIBDs using MIP solvers", (in Japanese), RIMS Kokyuroku 1636 (Decision Making and Mathematical Models under Uncertainty), pp. 177-184, 2009 (April).

  7. [07-2X] Takeoka, T. and T. Yamada, "Heuristic and exact algorithms for the fixed-charge multiple knapsack problem", (in Japanese), RIMS Kokyuroku 1548 (Decision Making and Mathematical Models under Uncertainty), pp. 99-106, 2007 (April).

  8. [06-3X] Taniguchi, F., S. Kataoka and T. Yamada, "Max-min optimization of the multi-objective knapsack problem", (in Japanese), RIMS Kokyuroku 1477 (Decision Making and Mathematical Models under Uncertainty), pp. 92-101, 2006 (March).

  9. [06-2X] Nomsiri, V. and T. Yamada, "Mini-max optimization of the multi-objective assignment problem", (in Japanese), RIMS Kokyuroku 1477 (Decision Making and Mathematical Models under Uncertainty), pp. 73-82, 2006 (March).

  10. [05-3X] Senisuka, A., B.-J. You, and T. Yamada, "Heuristic and exact algorithms for the knapsack problem with side constraints", (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 43, No. 1, pp. 15-24, 2005.

  11. [04-2X] You, B.-J., A. Senisuka and T. Yamada, "A pegging approach to the knapsack problem with side constraints", (in Japanese), RIMS Kokyuroku 1409 (Decision Theory and Optimization Algorithms), pp. 101-114, 2001 (March).

  12. [04-1X] Fujimoto, M. and T. Yamada, "Algorithms to listup all the discontinuity points of a knapsack function", (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 42, No. 1, pp. 115-124, 2004.

  13. [03-3X] Fujimoto, M., T. Yamada, S. Kataoka and K. Watanabe, "An exact algorithm for the generalized knapsack sharing problem", (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 41, No. 1, pp. 123-135, 2003.

  14. [03-2X] Yamada, T. K. Watanabe and S. Kataoka, "Listing up all the minimum spanning trees in an undirected graph," Optimization: Modeling and Algorithms 16, The Institute of Statistical Mathematics Cooperative Research Report 161, pp. 58-75, 2003. Also presented at IFORS 2002, July 8-12, 2002, Edinburgh, United Kingdom.

  15. [02-5X] Yamada, T. and M. Takahashi, "Heuristic and exact algorithms for the spanning tree detection problem" (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 39, No. 1, pp. 129-138, 2001. English version in Optimization: Modeling and Algorithms 15, The Institute of Statistical Mathematics Cooperative Research Report 148, pp. 69-83, 2002.

  16. [00-5X] Yamada, T. and H. Kinoshita, "An algorithm to find all the negative cycles in a directed graph," Optimization: Modeling and Algorithms 13, The Institute of Statistical Mathematics Cooperative Research Report 125. pp. 222-231, 2000.

  17. [00-4X] Nasu Y. and T. Yamada, "A class assignment method considering students' services" (in Japanese) in: OR Handbook 2000 (CD-ROM), Japan Society for Operations Research, May, 2000.

  18. [98-3X] Hatori, T. and T. Yamada, "Developing a class assignment system for comprehensive education: an application of WWW and linear programming" (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 36, No. 1, pp. 47-53, 1998.

  19. [97-3X] Buaphuan B. and T. Yamada, "Class assignment methods considering students' preferences and academic records" (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 35, No. 1, pp. 57-62, 1997.

  20. [96-4X] Kataoka, S. and T. Yamada, "Some approximation methods and tabu search for score orienteering problem" (in Japanese), Scientific and Engineering Reports of the National Defense Academy, Vol. 34, No. 1, pp. 109-117, 1996.

  21. [93-1X] Yamada, T. and S. Kataoka, "Resource allocation problems on a timed marked graph: suboptimal and exact algorithms," Proc. JTC-CSCC'93, Nara, Japan, 364-368, 1993.

  22. [83-1X] Yamada, T., "Structural controllability and observability of linear time-invariant descriptor systems," Ph.D. Dissertation, Stanford University, June, 1983.