ホーム > 鮏川 矩義/ Sukegawa, Noriyoshi
鮏川 矩義
ALUMNI 2023年6月現在、筑波大学が主たる所属機関ではありません
Sukegawa, Noriyoshi
筑波大学 , システム情報系 , 助教 University of Tsukuba , Faculty of Engineering, Information and Systems , Assistant Professor
関連記事はまだありません。
オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。
- 1. Predicting Online Item-Choice Behavior: A Shape-Restricted Regression Approach. Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano; Jiro Iwanaga Algorithms 16: 415 - 415 (2023) Semantic Scholar
- 2. 出産前後の情報検索の分析:数理最適化による検索日の確率分布推定 岩永 二郎; 西村 直樹; 鮏川 矩義; 高野 祐一 Transactions of the Japanese Society for Artificial Intelligence 37: D-L74_1 - 11 (2022) Semantic Scholar
- 3. Minimum point-overlap labeling Yuya Higashikawa; Keiko Imai; Takeharu Shiraga; Noriyoshi SukegawaYusuke Yokosuka OPTIMIZATION METHODS & SOFTWARE 印刷中: 2 - 11 (2020) Semantic Scholar
- 4. The diameter of lattice zonotopes Antoine Deza; Lionel Pournin; Noriyoshi Sukegawa Proceedings of the American Mathematical Society 148: 3507 - 3516 (2020)
- 5. Two efficient calculations of edit distance between marked point processes Yoshito Hirata; Noriyoshi Sukegawa Chaos 29: 101107:1 - 101107:7 (2019) Semantic Scholar
- 6. 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 - 100877 (2019) Semantic Scholar
- 7. 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)
- 8. An asymptotically improved upper bound on the diameter of polyhedra Noriyoshi Sukegawa Discrete and Computational Geometry 62: 1 - 10 (2018) Semantic Scholar
- 9. A simple projection algorithm for linear programming problems Tomonari Kitahara; Noriyoshi Sukegawa Algorithmica 81: 1 - 12 (2018) Semantic Scholar
- 10. 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 - 196 (2018) Semantic Scholar
- 11. The dial-a-ride problem with fairness Makoto Miyaoka; Noriyoshi Sukegawa; Takao Asano Journal of Advanced Mechanical Design Systems and Manufacturing In Press: 1 - 11 (2018) Semantic Scholar
- 12. A latent-class model for estimating product-choice probabilities from clickstream data Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano; Jiro Iwanaga Information Sciences 429: 406 - 420 (2018) Semantic Scholar
- 13. Exact clustering via integer programming and maximum satisfiability Atsushi Miyauchi; Tomohiro Sonobe; Noriyoshi Sukegawa Proceedings of the 32nd AAAI Conference on Artificial Intelligence 1387 - 1394 (2018)
- 14. 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 - 428 (2017) Semantic Scholar
- 15. Improving bounds on the diameter of a polyhedron in high dimensions Noriyoshi Sukegawa Discrete Mathematics 340: 2134 - 2142 (2017) Semantic Scholar
- 16. The dial-a-ride problem with regret minimization Makoto Miyaoka; Noriyoshi Sukegawa; Takao Asano Proceedings of the International Symposium on Scheduling 2019 33 - 38 (2017)
- 17. 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 - 344 (2017) Semantic Scholar
- 18. Estimating product-choice probabilities from recency and frequency of page views Jiro Iwanaga; Naoki Nishimura; Noriyoshi Sukegawa; Yuichi Takano Knowledge-Based Systems 99: 157 - 167 (2016) Semantic Scholar
- 19. A primal-simplex based Tardos' algorithm Shinji Mizuno; Noriyoshi Sukegawa; Antoine Deza Operations Research Letters 43: 625 - 628 (2015) Semantic Scholar
- 20. A refinement of Todd's bound for the diameter of a polyhedron Noriyoshi Sukegawa; Tomonari Kitahara Operations Research Letters 43: 534 - 536 (2015) Semantic Scholar
書籍等出版物情報はまだありません。
- 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. Recent advances in diameter of polyhedra Sukegawa, Noriyoshi Mixed Integer Programming Workshop 2021 feat. DANniversary 2021年5月24日 招待有り
- 3. 凸多面体の直径に対する組合せ的解析 鮏川 矩義 第32回RAMP数理最適化シンポジウム (RAMP2020) 2020年10月26日
- 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. An asymptotically improved upper bound on the diameter of polyhedra 鮏川, 矩義 Ghent Graph Theory Workshop On Structure and Algorithms, 2017 2017年1月1日
- 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. Improving bounds on the diameter of a polyhedron in high dimensions 鮏川, 矩義 Canadian Mathematical Society Winter Meeting 2016 2016年1月1日
- 8. Improving bounds on the diameter of a polyhedron in high dimensions Canadian Mathematical Society Winter Meeting 2016 2016年
- 9. Fractional programming formulation for the vertex coloring problem 鮏川, 矩義 3rd International Symposium on Combinatorial Optimization 2014年1月1日
- 10. Redundancy of the transitivity constraints in the linear ordering problem 鮏川, 矩義 Recent Advances in Linear Optimization 2014年1月1日
- 11. Redundant constraints in the standard formulation for the clique partitioning problem 鮏川, 矩義 26th European Conference on Operational Research 2013年1月1日
- 12. A cutting plane algorithm for mean-CVaR portfolio optimization with nonconvex transaction costs 鮏川, 矩義 26th European Conference on Operational Research 2013年1月1日
- 13. Lagrangian relaxation and pegging test for the clique partitioning problem 鮏川, 矩義 International Symposium on Mathematical Programming 2014 2012年1月1日
- 14. Lagrangian relaxation and pegging test for linear ordering problems 鮏川, 矩義 International Conference on Operations Research 2011 2011年1月1日
- 15. Lagrangian relaxation and pegging test for linear ordering problems 鮏川, 矩義 International Conference on Operations Research 2011 2011年1月1日
知財情報はまだありません。
100 total views