ホーム > 鮏川 矩義/ Sukegawa, Noriyoshi

鮏川 矩義

ALUMNI 2025年3月現在、筑波大学が主たる所属機関ではありません

Sukegawa, Noriyoshi

法政大学
Hosei University

https://sites.google.com/site/nsukeen/

オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。
  1. 1. Monotone Diameter of Bisubmodular Polyhedra. Yasuko Matsui; Noriyoshi Sukegawa; Ping Zhan
      Operations Research Forum 4: 76 (2023) Semantic Scholar
  2. 2. Predicting Online Item-Choice Behavior: A Shape-Restricted Regression Approach. Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano; Jiro Iwanaga
      Algorithms 16: 415 (2023) Semantic Scholar
  3. 3. 出産前後の情報検索の分析：数理最適化による検索日の確率分布推定 岩永 二郎; 西村 直樹; 鮏川 矩義; 高野 祐一
      Transactions of the Japanese Society for Artificial Intelligence 37: D-L74_1 (2022) Semantic Scholar
  4. 4. Minimum point-overlap labeling Yuya Higashikawa; Keiko Imai; Takeharu Shiraga; Noriyoshi SukegawaYusuke Yokosuka
      OPTIMIZATION METHODS & SOFTWARE 印刷中: 2 (2020) Semantic Scholar
  5. 5. Preface: Workshop on Advances in Optimization Antoine Deza; Tomonari Kitahara; Noriyoshi Sukegawa
      Discrete Applied Mathematics 275: 1 (2020) Semantic Scholar
  6. 6. The diameter of lattice zonotopes Antoine Deza; Lionel Pournin; Noriyoshi Sukegawa
      Proceedings of the American Mathematical Society 148: 3507 (2020)
  7. 7. Two efficient calculations of edit distance between marked point processes Yoshito Hirata; Noriyoshi Sukegawa
      Chaos 29: 101107:1 (2019) Semantic Scholar
  8. 8. Improving collaborative filtering recommendations by estimating user preferences from clickstream data Iwanaga, Jiro; Nishimura, Naoki; Sukegawa, Noriyoshi; Takano, Yuichi
      Electronic Commerce Research and Applications 37: 100877 (2019) Semantic Scholar
  9. 9. On the diameter of bisubmodular polyhedra Yasuko Matsui; Noriyoshi Sukegawa; Ping Zhan
      The Japan Conference on Discrete and Computational Geometry, Graphs, and Games 2019 (2019)
  10. 10. An asymptotically improved upper bound on the diameter of polyhedra Noriyoshi Sukegawa
      Discrete and Computational Geometry 62: 1 (2018) Semantic Scholar
  11. 11. A simple projection algorithm for linear programming problems Tomonari Kitahara; Noriyoshi Sukegawa
      Algorithmica 81: 1 (2018) Semantic Scholar
  12. 12. The dial-a-ride problem with fairness Makoto Miyaoka; Noriyoshi Sukegawa; Takao Asano
      Journal of Advanced Mechanical Design Systems and Manufacturing In Press: 1 (2018) Semantic Scholar
  13. 13. An enhanced primal-simplex based tardos' algorithm for linear optimization Shinji Mizuno; Noriyoshi Sukegawa; Antoine Deza
      Journal of the Operations Research Society of Japan 61: 186 (2018) Semantic Scholar
  14. 14. A latent-class model for estimating product-choice probabilities from clickstream data Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano; Jiro Iwanaga
      Information Sciences 429: 406 (2018) Semantic Scholar
  15. 15. Exact clustering via integer programming and maximum satisfiability Atsushi Miyauchi; Tomohiro Sonobe; Noriyoshi Sukegawa
      Proceedings of the 32nd AAAI Conference on Artificial Intelligence 1387 (2018)
  16. 16. Small degenerate simplices can be bad for simplex methods Shinji Mizuno; Noriyoshi Sukegawa; Antoine Deza
      Journal of the Operations Research Society of Japan 60: 419 (2017) Semantic Scholar
  17. 17. Improving bounds on the diameter of a polyhedron in high dimensions Noriyoshi Sukegawa
      Discrete Mathematics 340: 2134 (2017) Semantic Scholar
  18. 18. The dial-a-ride problem with regret minimization Makoto Miyaoka; Noriyoshi Sukegawa; Takao Asano
      Proceedings of the International Symposium on Scheduling 2019 33 (2017)
  19. 19. Minimum point-overlap labeling Yuya Higashikawa; Keiko Imai; Yusuke Matsumoto; Noriyoshi SukegawaYusuke Yokosuka
      Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10236: 334 (2017) Semantic Scholar
  20. 20. Estimating product-choice probabilities from recency and frequency of page views Jiro Iwanaga; Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano
      Knowledge-Based Systems 99: 157 (2016) Semantic Scholar
1 2

書籍等出版物情報はまだありません。

  1. 1. On the diameter of polyhedra and related topics Sukegawa, Noriyoshi
    HIM Workshop: Tropical geometry and the geometry of linear programming 2021年9月9日 招待有り
  2. 2. Recent advances in diameter of polyhedra Sukegawa, Noriyoshi
    Mixed Integer Programming Workshop 2021 feat. DANniversary 2021年5月24日 招待有り
  3. 3. 凸多面体の直径に対する組合せ的解析 鮏川 矩義
    第32回RAMP数理最適化シンポジウム (RAMP2020) 2020年10月26日
  4. 4. On the diameter of bisubmodular polyhedra Yasuko Matsui; Noriyoshi Sukegawa; Ping Zhan
    The Japan Conference on Discrete and Computational Geometry, Graphs, and Games 2019 2019年9月
  5. 5. An asymptotically improved upper bound on the diameter of polyhedra 鮏川, 矩義
    Ghent Graph Theory Workshop On Structure and Algorithms, 2017 2017年1月1日
  6. 6. An asymptotically improved upper bound on the diameter of polyhedra 鮏川, 矩義
    10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 2017年1月1日
  7. 7. Improving bounds on the diameter of a polyhedron in high dimensions 鮏川, 矩義
    Canadian Mathematical Society Winter Meeting 2016 2016年1月1日
  8. 8. Improving bounds on the diameter of a polyhedron in high dimensions
    Canadian Mathematical Society Winter Meeting 2016 2016年
  9. 9. Fractional programming formulation for the vertex coloring problem 鮏川, 矩義
    3rd International Symposium on Combinatorial Optimization 2014年1月1日
  10. 10. Redundancy of the transitivity constraints in the linear ordering problem 鮏川, 矩義
    Recent Advances in Linear Optimization 2014年1月1日
  11. 11. Redundant constraints in the standard formulation for the clique partitioning problem 鮏川, 矩義
    26th European Conference on Operational Research 2013年1月1日
  12. 12. A cutting plane algorithm for mean-CVaR portfolio optimization with nonconvex transaction costs 鮏川, 矩義
    26th European Conference on Operational Research 2013年1月1日
  13. 13. Lagrangian relaxation and pegging test for the clique partitioning problem 鮏川, 矩義
    International Symposium on Mathematical Programming 2014 2012年1月1日
  14. 14. Lagrangian relaxation and pegging test for linear ordering problems 鮏川, 矩義
    International Conference on Operations Research 2011 2011年1月1日
  15. 15. Lagrangian relaxation and pegging test for linear ordering problems 鮏川, 矩義
    International Conference on Operations Research 2011 2011年1月1日

 214 total views