ホーム > 鮏川 矩義/ Sukegawa, Noriyoshi
鮏川 矩義
ALUMNI
2026年2月現在、筑波大学が主たる所属機関ではありません
Sukegawa, Noriyoshi
法政大学 Hosei University
関連記事はまだありません。
オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。
-
21.
A primal-simplex based Tardos' algorithm
Shinji Mizuno; Noriyoshi Sukegawa; Antoine Deza
Operations Research Letters 43: 625 (2015) Semantic Scholar
-
22.
A refinement of Todd's bound for the diameter of a polyhedron
Noriyoshi Sukegawa; Tomonari Kitahara
Operations Research Letters 43: 534 (2015) Semantic Scholar
-
23.
Maximizing Barber's bipartite modularity is also hard
Atsushi Miyauchi; Noriyoshi Sukegawa
Optimization Letters 9: 897 (2015) Semantic Scholar
-
24.
Cutting Plane Algorithms for Mean-CVaR Portfolio Optimization with Nonconvex Transaction Costs
Takano, Yuichi; Nanjo, Keisuke; Sukegawa, Noriyoshi; Mizuno, Shinji
Computational Management Science 12: 319 (2015)
-
25.
Redundant constraints in the standard formulation for the clique partitioning problem
Atsushi Miyauchi; Noriyoshi Sukegawa
Optimization Letters 9: 199 (2015) Semantic Scholar
-
26.
Fractional programming formulation for the vertex coloring problem
Tomomi Matsui; Noriyoshi Sukegawa; Atsushi Miyauchi
Information Processing Letters 114: 706 (2014) Semantic Scholar
-
27.
Lagrangian relaxation and pegging test for the clique partitioning problem
Noriyoshi Sukegawa; Yoshitsugu Yamamoto; Liyuan Zhang
Advances in Data Analysis and Classification 7: 363 (2013) Semantic Scholar
-
28.
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
Noriyoshi Sukegawa; Atsushi Miyauchi
Discrete Optimization 10: 331 (2013) Semantic Scholar
-
29.
Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems
Noriyoshi Sukegawa; Yoshitsugu Yamamoto
Japan Journal of Industrial and Applied Mathematics 29: 547 (2012) Semantic Scholar
-
30.
Lagrangian relaxation and pegging test for linear ordering problems
Noriyoshi Sukegawa; Yoshitsugu Yamamoto; Liyuan Zhang
Journal of the Operations Research Society of Japan 54: 142 (2011) 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日
知財情報はまだありません。
566 total views
ORCID