Preprints

Refereed Journal Papers

1. H. Kikuchi, K. Nagano, S. Sun, T. Kitahara, and Y. Izunaga (2023):
   Construction and analysis of user network of a childcare Q&A App. [Link]
   Bulletin of the Computational Statistics of Japan, Vol.36, pp.5--13.
   
2. S. Takahashi, Y. Izunaga, and N. Watanabe (2022):
   An experimental study of VCG mechanism for multi-unit auctions: Competing with machine bidders. [Link]
   Evolutionary and Institutional Economics Review, Vol.19, pp.97--117.
   A preliminary version is available on RISS Discussion Paper Series. [Link]
3. Y. Izunaga, T. Matsui, and Y. Yamamoto (2020):
   A doubly nonnegative relaxation for modularity density maximization. [Link]
   Discrete Applied Mathematics, Vol.275, pp.69--78.
   A preliminary version is available on Optimization Online. [Link]
4. S. Takahashi, Y. Izunaga, and N. Watanabe (2019):
   VCG mechanism for multi-unit auctions and appearance of information: An experiment. [Link]
   Evolutionary and Institutional Economics Review, Vol.16, No.2, pp.357--374.
   A preliminary version is available on RISS Discussion Paper Series. [Link]
5. K. Sato and Y. Izunaga (2019):
   An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs. [Link]
   Computers & Operations Research, Vol.106, pp.236--245.
   A preliminary version, entitled A branch-and-price approach with MILP formulation to modularity density maximization on graphs, is available on arXiv. [Link]
6. S. Takahashi, Y. Izunaga, and N. Watanabe (2018):
   An approximation algorithm for multi-unit auctions: Numerical and subject experiments. [Link]
   Operations Research and Decisions, Vol.28, No.1, pp.95--115.
   A preliminary version is available on RISS Discussion Paper Series. [Link]
7. Y. Izunaga and Y. Yamamoto (2017):
   A cutting plane algorithm for modularity maximization problem. [Link]
   Journal of the Operations Research Society of Japan, Vol.60, No.1, pp.24--42.
8. Y. Izunaga, K. Sato, K. Tatsumi, and Y. Yamamoto (2015):
   Row and column generation algorithms for minimum margin maximization of ranking problems. [Link]
   Journal of the Operations Research Society of Japan, Vol.58, No.4, pp.394--409.

Refereed Conference Proceedings

1. Y. Izunaga, S. Takahashi, and N. Watanabe (2022):
   A subject experiment of an approximate DGS algorithm: Price increment, allocative efficiency, and seller's revenue. [Link]
   Proceedings of 2022 IEEE International Conference on Big Data.
2. Y. Izunaga, K. Sato, K. Tatsumi, and Y. Yamamoto (2016):
   Row and column generation algorithm for maximization of minimum margin for ranking problems. [Link]
   Operations Research Proceedings 2014, pp.249--255.
3. K. Inaba, Y. Izunaga, and Y. Yamamoto (2016):
   A Lagrangian relaxation algorithm for modularity maximization problem. [Link]
   Operations Research Proceedings 2014, pp.241--247.

Other Papers

1. Y. Izunaga and K. Sato (2018):
   A bounding algorithm for selective graph coloring problem. [Link]
   RIMS Kokyuroku, Vol.2069, pp.84--94.
2. Y. Izunaga, T. Matsui, and Y. Yamamoto (2016):
   A doubly nonnegative relaxation for modularity density maximization. [Link]
   RIMS Kokyuroku, Vol.1981, pp.84--97.
3. Y. Izunaga, K. Sato, K. Tatsumi, and Y. Yamamoto (2015):
   Row and column generation algorithm for maximization of minimum margin for ranking problems. [Link]
   RIMS Kokyuroku, Vol.1931, pp.18--30.