|
松井知己 研究業績一覧 (189件)
![2024 2024](/ls_arrow.gif)
![1976 1976](/ll_arrow.gif)
![1972 1972](/l_arrow.gif)
- 1971
- 1970
- 1969
- 1968
- 1967
![1970 1970](/r_arrow.gif)
![1966 1966](/rr_arrow.gif)
- 全件表示
論文
-
Yuto Ushioda,
Masato Tanaka,
Tomomi Matsui.
Monte Carlo Methods for the Shapley--Shubik Power Index,
Games,
Vol. 13,
No. 3,
June 2022.
-
Masato Tanaka,
Tomomi Matsui.
Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games,
Mathematical Social Sciences,
Vol. 115,
pp. 47-51,
Jan. 2022.
-
Akihiro Kawana,
Tomomi Matsui.
Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games,
Theory and Decision,
July 2021.
-
Yasushi,
Tomomi Matsui,
Atsushi Miyauchi.
Additive approximation algorithms for modularity maximization,
Journal of Computer and System Sciences,
Vol. 117,
pp. 182-201,
May 2021.
-
Yusei Fujimori,
Yasushi Kawase,
Tomomi Matsui,
Akiyoshi Shioura.
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption,
Information processing letters,
Oct. 2020.
-
Yoichi Izunaga,
Tomomi Matsui,
Yoshitsugu Yamamoto.
A Doubly Nonnegative Relaxation for Modularity Density Maximization,
Discrete Applied Mathematics,
Vol. 275,
No. 31,
pp. 69-78,
Mar. 2020.
-
Ryuta Tamura,
Ken Kobayashi,
Yuichi Takano,
Ryuhei Miyashiro,
Kazuhide Nakata,
Tomomi Matsui.
Mixed Integer Quadratic Optimization Formulations for Eliminating Multicollinearity Based on Variance Inflation Factor,
Journal of Global Optimization,
Vol. 70,
pp. 431-446,
Jan. 2019.
-
田村隆太,
小林健,
高野祐一,
宮代隆平,
中田和秀,
松井知己.
多重共線性を考慮した回帰式の変数選択問題の定式化,
オペレーションズ・リサーチ,
Vol. 63,
No. 3,
pp. 128-133,
Mar. 2018.
-
Tomomi Matsui,
Yuichiro Miyamoto.
Characterizing Delaunay graphs via fixed point theorem: a simple proof,
Journal of the Operations Research Society of Japan,
Operations Research Society of Japan,
Vol. 61,
No. 1,
pp. 151-162,
Jan. 2018.
公式リンク
-
Ryuta Tamura,
Ken Kobayashi,
Yuichi Takano,
Ryuhei Miyashiro,
Kazuhide Nakata,
Tomomi Matsui.
Best subset selection for eliminating multicollinearity,
Journal of the Operations Research Society of Japan,
Vol. 60,
pp. 321-336,
Oct. 2017.
-
Tomomi Matsui,
Katsunori Ano.
COMPARE THE RATIO OF SYMMETRIC POLYNOMIALS OF ODDS TO ONE AND STOP,
Journal of Applied Probability,
Applied Probability Trust,
Vol. 54,
Issue 1,
pp. 12-22,
Apr. 2017.
-
Yukihide Kohira,
Chikaaki Kodama,
Tomomi Matsui,
Atsushi Takahashi,
Shigeki Nojima,
Satoshi Tanaka.
Yield-aware mask assignment by positive semidefinite relaxation in triple patterning using cut process,
Journal of Micro/Nanolithography, MEMS, and MOEMS (JM3),
Vol. 15,
No. 2,
pp. 1-7,
Mar. 2016.
-
Tomomi Matsui,
Katsunori Ano.
Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings,
Mathematics of Operations Research,
INFORMS,
Volume 41,
No. 2,
pp. 700-714,
Feb. 2016.
-
Tomomi Matsui,
Rudolf Scheifele.
A Linear Time Algorithm for the Unbalanced Hitchcock Transportation Problem,
Networks. Volume 67, Issue 2,
2016.
-
Tomomi Matsui,
Ano, K..
A note on a lower bound for the multiplicative odds theorem of optimal stopping,
Journal of Applied Probability,
Vol. 51,
No. 3,
pp. 885-889,
2014.
-
Tomomi Matsui,
Sukegawa, N.,
Miyauchi, A..
Fractional programming formulation for the vertex coloring problem,
Information Processing Letters,
Vol. 114,
No. 12,
pp. 706-709,
2014.
-
IWAIKAWA Yutaka,
KAMIYAMA Naoyuki,
MATSUI Tomomi.
Improved Approximation Algorithms for Firefighter Problem on Trees,
IEICE Transactions on Information and Systems,
The Institute of Electronics, Information and Communication Engineers,
Vol. 94,
No. 2,
pp. 196-199,
Aug. 2013.
-
Tomomi Matsui.
NP-Completeness of Arithmetical Restorations,
Journal of Information Processing,
Vol. 21,
No. 3,
pp. 402-404,
July 2013.
-
Tomonari Kitahara,
Tomomi Matsui,
Shinji Mizuno.
On the Number of Solutions Generated by Dantzig's Simplex Method for LP with Bounded Variables,
Pacific Journal of Optimization,
Vol. 8,
No. 2,
pp. 447-455,
Nov. 2012.
-
Ryuhei Miyashiro,
Tomomi Matsui,
Shinji Imahori.
An Approximation Algorithm for the Traveling Tournament Problem,
Annals of Operations Research,
Vol. 194,
No. 1,
pp. 317-324,
Apr. 2012.
-
Ryuta Ando,
Tomomi Matsui.
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane,
Proceedings of the 22th International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science,
Vol. 7074,
pp. 474-483,
Dec. 2011.
-
Daisuke Yamaguchi,
Shinji Imahori,
Ryuhei Miyashiro,
Tomomi Matsui.
An Improved Approximation Algorithm for the Traveling Tournament Problem,
Algorithmica,
Vol. 61,
pp. 1077-1091,
Sept. 2011.
-
Hirotatsu Kobayashi,
Tomomi Matsui.
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists,
Algorithmica,
Vol. 58,
No. 1,
pp. 151-169,
Sept. 2010.
-
Tomomi Matsui.
Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists,
Operations Research Proceedings 2010,
Sept. 2010.
-
越川 満,
内山 将夫,
梅谷 俊治,
松井 知己,
山本 幹雄.
統計的機械翻訳におけるフレーズ対応最適化を利用したN-best翻訳候補のリランキング,
情報処理学会論文誌,
一般社団法人情報処理学会,
Vol. 51,
No. 8,
pp. 1443-1451,
Aug. 2010.
-
MATSUI Tomomi,
MOTOKI Mitsuo,
KAMATANI Naoyuki,
KIJIMA Shuji.
Polynomial time approximate or perfect samplers for discretized Dirichlet distribution,
Japan journal of industrial and applied mathematics,
Vol. 27,
No. 1,
pp. 91-123,
May 2010.
-
Yusuke Kuroki,
Tomomi Matsui.
An Approximation Algorithm for Multidimensional Assignment Problems Minimizing the Sum of Squared Errors,
Discrete Applied Mathematics,
Vol. 157,
No. Issue 9,
pp. 2124--2135,
May 2009.
-
Masaru Iwasa,
Hiroo Saito,
Tomomi Matsui.
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks and Related Metric Labeling Problems,
Discrete Applied Mathematics,
Vol. 157,
No. Issue 9,
pp. 2078--2088,
May 2009.
-
Yuichiro Miyamoto,
Tomomi Matsui.
Perfectness and imperfectness of unit disk graphs on triangular lattice points,
Discrete Mathematics,
Vol. 309,
No. Issue 9,
pp. 2733-2744,
May 2009.
-
Hiroo Saito,
Tetsuya Fujie,
Tomomi Matsui,
Shiro Matuura.
A study of the quadratic semi-assignment polytope,
Discrete Optimization,
Vol. 61,
No. 1,
pp. 37-50,
Feb. 2009.
-
Hirotatsu Kobayashi,
Tomomi Matsui.
Successful Manipulation in Stable Marriage Model with Complete Preference Lists,
IEICE TRANSACTIONS on Information and Systems,
Vol. 92-D,
No. 2,
pp. 116-119,
Feb. 2009.
-
Shuji Kijima,
Tomomi Matsui.
Approximation algorithm and perfect sampler for closed Jackson networks with single servers,
SIAM Journal on Computing,
Vol. 38,
No. Issue 4,
pp. 1484-1503,
Sept. 2008.
-
Shuji Kijima,
Tomomi Matsui.
Randomized Approximation Scheme and Perfect Sampler for Closed Jackson networks with Multiple Servers,
Annals of Operations Research,
Vol. 162,
pp. 35-55,
June 2008.
-
Shuji Kijima,
Tomomi Matsui,
Hiroe Tsubaki,
Ken Nishina,
Shu Yamada.
Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution,
The Grammer of Technology Development,
pp. 179-199,
Jan. 2008.
-
澤井賢一,
黒木裕介,
松井知己.
フルートの運指最適化と逆最適化を用いたパラメータチューニング,
オペレーションズ・リサーチ,
Vol. 53,
No. 1,
pp. 39-46,
Jan. 2008.
-
Hadas Shachnai,
Lisa Zhang,
Tomomi Matsui.
Exact Algorithms for the Master Ring Problem,
Networks,
Vol. 52,
No. 2,
pp. 98-107,
Jan. 2008.
-
Nobutomo Fujiwara,
Shinji Imahori,
Tomomi Matsui,
Ryuhei Miyashiro.
Constructive Algorithms for the Constant Distance Traveling Tournament Problem,
Lecture Notes in Computer Science,
Vol. 3876,
pp. 135-146,
Dec. 2007.
-
Ayami Suzuka,
Ryuhei Miyashiro,
{Akiko Yoshise,
Tomomi Matsui.
The home-away assignment problems and break minimization/maximization problems in sports scheduling,
Pacific Journal of Optimization,
Vol. 3,
No. 1,
pp. 113-133,
Jan. 2007.
-
Shuji Kijima,
Tomomi Matsui.
Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables,
Random Structures and Algorithms,
Vol. 29,
No. 3,
pp. 243-256,
Sept. 2006.
-
Greg Aloupis,
Thomas Fevens,
Tomomi Matsui,
Antonio Mesa,
Yurai Nunez,
David Rappaport,
Godfried Toussaint.
Algorithms for Computing Geometric Measures of Melodic Similarity,
Computer Music Journal,
Vol. 30,
No. 3,
pp. 67-77,
Sept. 2006.
-
Ryuhei Miyashiro,
Tomomi Matsui.
Semidefinite programming based approaches to the break minimization problem,
Computers and Operations Research,
Vol. 33,
No. 7,
pp. 1975-1982,
July 2006.
-
Ayami Suzuka,
Ryuhei Miyashiro,
{Akiko Yoshise,
Tomomi Matsui.
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E89-A,
No. 5,
pp. 1407-1416,
May 2006.
-
Shu YAMADA,
Michiyo MATSUI,
Tomomi Matsui,
Dennis K. J. LIN,
Takenori TAKAHASHI.
A general construction method for mixed-level supersaturated design,
Computational Statistics and Data Analysis,
Vol. 50,
No. 1,
pp. 254-265,
Jan. 2006.
-
Ryuhei Miyashiro,
Tomomi Matsui.
A polynomial time algorithm to find an equitable home-away assignment,
Operations Research Letters,
Vol. 33,
No. 3,
pp. 235-241,
May 2005.
-
Tomomi Matsui,
Yasuko MATSUI,
Yoko ONO.
Random generation of 2 X 2 X...X 2 X J contingency tables,
Theoretical Computer Science,
Vol. 326,
No. 1-2,
pp. 117-135,
Oct. 2004.
-
Yuichiro Miyamoto,
Tomomi Matsui.
Linear time approximation algorithm for multicoloring lattice graphs with diagonals,
Journal of Operations Research Society of Japan,
Vol. 47,
No. 2,
pp. 123-128,
June 2004.
-
Shuji Kijima,
Tomomi Matsui.
Approximate counting scheme for mxn contingency tables,
IEICE Transactions on Information and Systems,
Vol. E87-D,
No. 2,
pp. 308-314,
Feb. 2004.
-
Ryuhei Miyashiro,
Hideya Iwasaki,
Tomomi Matsui.
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks,
Practice and Theory of Automated Timetabling IV (PATAT2002), Selected Revised Papers, Lecture Notes in Computer Science,
Vol. 2740,
pp. 78-99,
Aug. 2003.
-
Shiro Matuura,
Tomomi Matsui.
New approximation algorithms for MAX 2SAT and MAX DICUT,
Journal of Operations Research Society of Japan,
Vol. 46,
No. 2,
pp. 178-188,
June 2003.
-
Shu YAMADA,
Tomomi Matsui.
Optimality of Mixed Level Supersaturated Designs,
Journal of Statistical Planning and Inference,
Vol. 104,
No. 2,
pp. 459-469,
June 2002.
-
Hiroo Saito,
Shiro Matuura,
Tomomi Matsui.
A Linear Relaxation for Hub Network Design Problems,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E85-A,
No. 5,
pp. 1000--1005,
May 2002.
-
Ryuhei Miyashiro,
Tomomi Matsui.
Notes on equitable round-robin tournaments,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E85-A,
No. 5,
pp. 1006-1010,
May 2002.
-
Riyo Endo,
Katsunori Ano,
Tomomi Matsui.
Modified Banzhaf index for voting games,
International Journal Mathematics, Game Theory, and Algebra,
Vol. 12,
No. 4,
pp. 301-312,
Jan. 2002.
-
Masashi KIYOM,
Tomomi Matsui.
Integer Programming Based Algorithms for Peg Solitaire Problems,
Computers and Games, LNCS,
Vol. 2063,
pp. 229-240,
Oct. 2001.
-
Yasuko MATSUI,
Tomomi Matsui.
NP-completeness for calculating power indices of weighted majority games,
Theoretical Computer Science,
Vol. 263,
No. 1-2,
pp. 305-310,
July 2001.
-
Tetsuo ASANO,
Tomomi Matsui,
Takeshi TOKUYAMA.
Optimal Rounding of Sequences and Matrices,
Nordic Journal of Computing,
Vol. 7,
No. 3,
pp. 241-256,
July 2000.
-
Tomomi Matsui,
Yasuko MATSUI.
A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games,
Journal of the Operations Research Society of Japan,
Vol. 43,
No. 1,
pp. 71-86,
Mar. 2000.
-
Tomomi Matsui.
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs,
Discrete and Computational Geomerty, Lecture Notes in Computer Science,
Vol. 1763,
pp. 194-200,
Jan. 2000.
-
宮本裕一郎,
松井知己.
チャネル割当問題の解法,
情報処理学会論文誌, 数理モデル化と応用,
Vol. 40,
No. SIG2(TOM1),
pp. 23-32,
Feb. 1999.
-
Satoru IWATA,
Tomomi Matsui,
S. Thomas McCormic.
A Fast Bipartite Network Flow Algorithm for Selective Assembly,
Operations Research Letters,
Vol. 22,
No. 4-5,
pp. 137-143,
May 1998.
-
Tomomi Matsui.
A flexible algorithm for generating all the spanning trees in undirected graphs,
Algorithmica,
Vol. 18,
No. 4,
pp. 530-544,
Aug. 1997.
-
Tomomi Matsui.
NP-hardness of Linear Multiplicative Programming and Related Problems,
Journal of Global Optimization,
Vol. 9,
No. 2,
pp. 113-119,
Sept. 1996.
-
Yasuko MATSUI,
Tomomi Matsui.
An Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs,
Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science, Springer-Verlag,
Vol. 1120,
pp. 18-26,
May 1996.
-
Tomomi Matsui.
Is a given flow uncontrollable?,
IEICE Trans. Fundamentals,
Vol. E79-A,
No. 4,
pp. 448-451,
Apr. 1996.
-
Tomomi Matsui.
The minimum spanning tree problem on a planar graph,
Discrete Applied Mathematics,
Vol. 58,
No. 1,
pp. 91-94,
Mar. 1995.
-
Tomomi Matsui,
English.
Adjacency on Combinatorial Polyhedra,
Discrete Applied Mathematics,
Vol. 56,
No. 2-3,
pp. 311-321,
Jan. 1995.
-
Maiko SHIGENO,
Yasufumi SARUWATARI,
Tomomi Matsui.
An Algorithm for Fractional Assignment Problems,
Discrete Applied Mathematics,
Vol. 56,
No. 2-3,
pp. 333-343,
Jan. 1995.
-
Yoshiyasu YAMADA,
Tomomi Matsui,
Manabu SUGIYAMA.
An inefficiency measurement method for management systems,
Journal of Operations Research Society of Japan,
Vol. 37,
No. 2,
pp. 158-168,
June 1994.
-
Tomomi Matsui,
Akihisa TAMURA,
Yoshiko IKEBE.
Algorithms for Finding a Kth Best Valued Assignment,
Discrete Applied Mathematics,
Vol. 50,
No. 3,
pp. 283-296,
May 1994.
-
吉田泰子,
松井知己.
2部グラフの辺彩色の列挙解法,
電気学会誌C部門誌,
Vol. 114-C,
No. 4,
pp. 444-449,
Apr. 1994.
-
Komei FUKUDA,
Tomomi Matsui.
Finding All the Perfect Matchings in Bipartite Graphs,
Applied Mathematics Letters,
Vol. 7,
No. 1,
pp. 15-18,
Jan. 1994.
-
Yoshiko IKEBE,
Tomomi Matsui,
Akihisa TAMURA.
Adjacency of the Best and Second Valued Best Solutions in Combinatorial Optimization Problems,
Discrete Applied Mathematics,
Vol. 47,
No. 3,
pp. 227-232,
Dec. 1993.
-
Yasufumi SARUWATARI,
Tomomi Matsui.
A Note on K Best Solutions to the Chinese Postman Problem,
SIAM Journal on Optimization,
Vol. 3,
No. 4,
pp. 726-733,
Nov. 1993.
-
Komei FUKUDA,
Tomomi Matsui.
Finding All Minimum-Cost Perfect Matchings in Bipartite Graphs,
Networks,
Vol. 22,
No. 4,
pp. 461-468,
Dec. 1992.
-
宮川雅巳,
松井知己,
高野博行.
量反応デ-タに基づく二変量同時分布のノンパラメトリック推定,
応用統計学,
Vol. 20,
No. 1,
pp. 1-10,
July 1991.
-
Komei FUKUDA,
Tomomi Matsui.
On the Finiteness of the Criss-Cross Method,
European Journal of Operational Research,
Vol. 52,
No. 4,
pp. 119--124,
May 1991.
-
Hiroshi KONNO,
Yasutoshi YAJIMA,
Tomomi Matsui.
Parametric Simplex Algorithms for Solving a Special Class of Nonconvex Minimization Problems,
Journal of Global Optimization,
Vol. 1,
No. 1,
pp. 65-81,
Jan. 1991.
国際会議発表 (査読有り)
-
Yukihide Kohira,
Haruki Nakayama,
Naoki Nonaka,
Tomomi Matsui,
Atsushi Takahashi,
Chikaaki Kodama.
A formulation of mask optimization into QUBO model for Ising machines,
Proc. SPIE 12751, Photomask Technology 2023, 127511D,
Nov. 2023.
-
Rina Azuma,
Yukihide Kohira,
Tomomi Matsui,
Atsushi Takahashi,
Chikaaki Kodama.
Process variation-aware mask optimization with iterative improvement by subgradient method and boundary flipping,
Proc. SPIE 11328, Design-Process-Technology Co-optimization for Manufacturability XIV, 113280O,
pp. 1-7,
Mar. 2020.
-
Masato Tanaka,
Tomomi Matsui.
Calculating the Least Core Value of Weighted Voting Games,
The 12th Annual Meeting of the Asian Association for Algorithms and Computation,
Apr. 2019.
-
Yuto Ushioda,
Tomomi Matsui.
Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games,
The 21st Japan–Korea Joint Workshop on Algorithms and Computation,
Proceedings of WAAC2018,
Aug. 2018.
-
Akihiro Kawana,
Tomomi Matsui.
Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games,
Seventh International Workshop on Computational Social Choice (COMSOC-2018),
Workshop Notes COMSOC2018,
June 2018.
-
Akihiro Kawana,
Tomomi Matsui.
Trading Transforms of Non-weighted Simple Games,
East Asian Game Theory Conference,
p. AS7-01-03,
Aug. 2017.
-
Yasushi Kawase,
Tomomi Matsui,
Atsushi Miyauchi.
'Additive approximation algorithms for modularity maximization,
the 27th International Symposium on Algorithms and Computation,
2017.
-
Yuko Kuroki,
Tomomi Matsui.
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems,
WALCOM: Algorithms and Computation,
2017.
-
Yasushi Kawase,
Tomomi Matsui,
Atsushi Miyauchi.
Additive Approximation Algorithms for Modularity Maximization,
The 27th International Symposium on Algorithms and Computation,
Proceedings of ISAAC2016,
pp. 43:1-43:13,
Dec. 2016.
-
Yukihide Kohira,
Atsushi Takahashi,
Tomomi Matsui,
Chikaaki Kodama,
Shigeki Nojima,
Satoshi Tanaka.
Manufacturability-aware Mask Assignment in Multiple Patterning Lithography,
Proc. the 2016 IEEE Asia-Pacific Conference on Circuits and Systems (APCCAS 2016),
pp. 538-541,
Oct. 2016.
公式リンク
-
Jun Takita,
Yasushi Kawase,
Tomomi Matsui.
Auction Algorithm for Weighted Matroid Partitioning Problem,
Asian Association for Algorithms and Computation (AAAC2016),
2016.
-
Yuko Kuroki,
Tomomi Matsui.
Approximation Algorithms for Hub Location Problems,
Asian Association for Algorithms and Computation (AAAC2016),
2016.
-
Yukihide Kohira,
Chikaaki Kodama,
Tomomi Matsui,
Atsushi Takahashi,
Shigeki Nojima,
Satoshi Tanaka.
Yield-aware mask assignment using positive semidefinite relaxation in LELECUT triple patterning,
Proc. SPIE 9427, Design-Process-Technology Co-optimization for Manufacturability IX, 94270B,
1-9,
Mar. 2015.
-
Yukihide Kohira,
Tomomi Matsui,
Yoko Yokoyama,
Chikaaki Kodama,
Atsushi Takahashi,
Shigeki Nojima,
Satoshi Tanaka.
Fast Mask Assignment using Positive Semidefinite Relaxation in LELECUT Triple Patterning Lithography,
Proc. Asia and South Pacific Design Automation Conference 2015 (ASP-DAC 2015),
pp. 665-670,
Jan. 2015.
-
Tomomi Matsui,
Yukihide Kohira,
Chikaaki Kodama,
Atsushi Takahashi.
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography,
the 25th International Symposium on Algorithms and Computation (ISAAC 2014),
Algorithms and Computation, Lecture Notes in Computer Science,
LNCS 8889,
pp. 365–375,
Nov. 2014.
-
Tomomi Matsui,
Yuichiro Miyamoto.
Characterizing Delaunay Graphs via Fixed Point Theorem,
24th Canadian Conference on Computational Geometry,
PROCEEDINGS of CCCG 2012,
pp. 249-254,
Aug. 2012.
-
Takashi Masuko,
Tomomi Matsui.
Minimum Cost Home-Away Assignment of Double Round-Robin Tournament,
3rd International Conference on Mathematics in Sport Proceedings Papers,
pp. 125-131,
June 2011.
-
Naoyuki Kamiyama,
Tomomi Matsui.
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking,
17th Computing: The Australasian Theory Symposium (CATS 2011) and in the Australian Computer Society series Conferences in Research and the Practice in Information Technology (CRPIT),
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium,
Vol. 119,
pp. 137-144,
Jan. 2011.
-
Shinji Imahori,
Tomomi Matsui,
Ryuhei Miyashiro.
An Approximation Algorithm for the Unconstrained Traveling Tournament Problem,
The 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010),
Annals of Operations Research,
pp. 508-512,
Aug. 2010.
-
Yuko Moriyama,
Tomomi Matsui.
Algorithms for Domino Portrait Generation,
The 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2010),
Apr. 2010.
-
Ryo Nakatsubo,
Shuji Kijima,
Tomomi Matsui.
Computational Experiments on Perfect Sampling of Contingency Tables,
The 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2010),
Apr. 2010.
-
Daisuke Yamaguchi,
Shinji Imahori,
Ryuhei Miyashiro,
Tomomi Matsui.
An Improved Approximation Algorithm for the Traveling Tournament Problem,
20th International Symposium on Algorithms and Computation (ISAAC 2009),
Algorithms and Computation Lecture Notes in Computer Science,
Vol. 5878,
pp. 679-688,
Dec. 2009.
-
Ryuhei Miyashiro,
Tomomi Matsui,
Shinji Imahori.
An Approximation Algorithm for the Traveling Tournament Problem,
Proceedings of PATAT 2008 (The 7th International Conference on the Practice and Theory of Automated Timetabling),
Oct. 2008.
-
Hirotatsu Kobayashi,
Tomomi Matsui.
Successful Manipulation in Stable Marriage Model with Complete Preference Lists,
Matching Under Preferences, Satelite workshop of ICALP 2008,
pp. 17-22,
June 2008.
-
Yusuke KUROKI,
Tomomi Matsui.
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem,
Optimal Discrete Structures and Algorithms,
pp. 30,
Sept. 2006.
-
Masaru Iwasa,
Hiroo Saito,
Tomomi Matsui.
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks,
Optimal Discrete Structures and Algorithms,
pp. 24,
Sept. 2006.
-
Ryuhei Miyashiro,
Tomomi Matsui.
Minimizing the carry-over effects value in a round-robin tournament,
The 6th international conference on the Practice And Theory of Automated Timetabling (PATAT 2006),
Proceedings of the 6th international conference on the Practice And Theory of Automated Timetabling,
pp. 460-463,
Aug. 2006.
-
Nobutomo Fujiwarai,
Shinji Imahori,
Tomomi Matsui,
Ryuhei Miyashiro.
Constructive algorithms for the constant distance traveling tournament problem,
The 6th international conference on the Practice And Theory of Automated Timetabling (PATAT 2006),
Proceedings of the 6th international conference on the Practice And Theory of Automated Timetabling,
pp. 402-405,
Aug. 2006.
-
Shuji Kijima,
Tomomi Matsui.
Randomized approximation scheme and perfect sampler for closed Jackson networks,
Second Madrid Conference on Queueing Theory,
July 2006.
-
Yuichiro Miyamoto,
Tomomi Matsui.
Approximation algorithms for minimum span channel assignment problems,
2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06),
Algorithmic Aspects in Information and Management Lecture Notes in Computer Science,
Vol. 4041,
pp. 334-342,
June 2006.
-
Shuji Kijima,
Tomomi Matsui.
Approximate/perfect samplers for closed Jackson networks,
The 2005 Winter Simulation Conference (WSC '05),
Proceedings of the 2005 Winter Simulation Conference,
pp. 862-868,
Dec. 2005.
-
Masashi Kiyomii,
Takeaki Unoi,
Tomomi Matsui.
Efficient Algorithms for the Electric Power Transaction Problem,
WINE 2005,
Internet and Network Economics Lecture Notes in Computer Science,
Vol. 3828,
pp. 602-611,
Dec. 2005.
-
Shuji Kijima,
Tomomi Matsui.
Polynomial Time Perfect Sampler for Closed Jackson Networks with Single Servers,
The 5th International Symposium on Operations Research and Its Applications (ISORA2005),
Lecture Notes in Operations Research,
pp. 227-240,
Aug. 2005.
-
Shuji Kijima,
Tomomi Matsui.
Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distributions on Simplex,
2005 International Conference on Analysis of Algorithms,
Proceedings of the 2005 International Conference on the Analysis of Algorithms, Discrete Mathematics and Computer Science, DMTCS Proceedings Series,
Vol. AD,
pp. 369-380,
June 2005.
-
Yuichiro Miyamoto,
Tomomi Matsui.
Perfectness and Imperfectness of the kth Power of Lattice Graphs,
The First International Conference on Algorithmic Applications in Management,
Algorithmic Applications in Management Lecture Notes in Computer Science,
Vol. 3521,
pp. 233-242,
June 2005.
-
Ryuhei Miyashiro,
Akiko YOSHISE,
Tomomi Matsui.
Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling,
The First International Conference on Algorithmic Applications in Management,
Algorithmic Applications in Management Lecture Notes in Computer Science,
Vol. 3521,
pp. 95-103,
June 2005.
-
Yuichiro Miyamoto,
Tomomi Matsui.
Multicoloring Unit Disk Graphs on Triangular Lattice Points,
Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA05),
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA05),
pp. 895-896,
Jan. 2005.
-
Shuji Kijima,
Tomomi Matsui.
Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables,
Mathematics and Computer Science III Trends in Mathematics,
pp. 175-186,
Sept. 2004.
-
Ryuhei Miyashiro,
Tomomi Matsui.
The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams,
The 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT2004),
The 5th International Conference on the Practice and Theory of Automated Timetabling,
pp. 535-538,
Aug. 2004.
-
Tomomi Matsui,
Mitsuo MOTOKI,
Naoyuki KAMATANI.
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution,
14th International Symposium, ISAAC 2003,
Algorithms and Computation Lecture Notes in Computer Science,
Vol. 2906,
pp. 676-685,
Dec. 2003.
-
Greg Aloupis,
Thomas Fevens,
Stefan Langerman,
Tomomi Matsui,
Antonio Mesa,
David Rappaport,
Godfried Toussaint.
Computing the Similarity of two Melodies,
15th Canadian Conference on Computational Geometry (CCCG2003),
15th Canadian Conference on Computational Geometry (CCCG2003),
Aug. 2003.
-
Shuji Kijima,
Tomomi Matsui.
Sampling Algorithm for Two-rowed Contingency Tables,
Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03),
pp. 73-85,
July 2003.
-
Hiroo Saito,
Tetsuya Fujie,
Tomomi Matsui.
Polyhedral Approach to the Hub Network Design Problem,
Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03),
pp. 22-25,
July 2003.
-
Tomomi Matsui,
Mitsuo MOTOKI,
Naoyuki KAMATANI.
A Rapidly Mixing Approximate Sampler of Dirichlet Distribution,
Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03),
pp. 61-72,
July 2003.
-
Shuji Kijima,
Tomomi Matsui.
Approximate counting scheme for m x n contingency tables,
The Japan Conference on Discrete and Computational Geometry (JCDCG),
pp. 59-60,
Dec. 2002.
-
Ryuhei Miyashiro,
Hideya Iwasaki,
Tomomi Matsui.
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks,
The 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT2002),
Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling,
pp. 311-313,
Aug. 2002.
-
Riyo Endo,
Katsunori Ano,
Tomomi Matsui.
Modified Banzhaf index for voting games,
Game theory and applications,
Vol. VIII,
pp. 29-42,
June 2002.
-
Shiro Matuura,
Tomomi Matsui.
0.863 Approximation Algorithm for MAX DICUT,
4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomness and Application Techniques in Computer Science, RANDOM 2001,
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques Lecture Notes in Computer Science,
Vol. 2129,
pp. 138-146,
Aug. 2001.
-
Tomomi Matsui,
Takahiro WATANABE.
Sealed Bid Multi-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions,
4th Pacific Rim International Workshop on Multi-Agents, PRIMA2001,
Intelligent Agents: Specification, Modeling, and Applications Lecture Notes in Computer Science,
Vol. 2132,
pp. 78-92,
July 2001.
-
Yasuko MATSUI,
Tomomi Matsui.
NP-completeness for Calculating Power Indices of Weighted Majority Games,
Proceedings 10th Franco-Japanese & 5th Franco-Chinese Conference combinatorics and computer Science.,
July 2001.
-
Tetsuo ASANO,
Naoki FUJIKAWA,
Naoki KATOH,
Tomomi Matsui,
Hiroshi NAGAMOCHI,
Koji OBOKATA,
Takeshi TOKUYAMA.
Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow,
Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation,
pp. 21-28,
June 2001.
-
Ryuhei Miyashiro,
Tomomi Matsui.
Note on Equitable Round-Robin Tournaments,
Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation,
pp. 135-140,
June 2001.
-
Hiroo Saito,
Shiro Matuura,
Tomomi Matsui.
Linear Relaxation for Hub Location Problems,
Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation,
pp. 15-20,
June 2001.
-
Tetsuo ASANO,
Tomomi Matsui,
Takeshi TOKUYAMA.
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices,
SWAT 2000,
Algorithm Theory - SWAT 2000 Lecture Notes in Computer Science,
Vol. 1851,
pp. 476-489,
July 2000.
-
Tomomi Matsui.
Repairing a Flaw in Contour Maps,
Proceedings of the Third KOREA-JAPAN Joint Workshop on Algorithms and Computation,
pp. 80-83,
Jan. 1999.
-
Tomomi Matsui.
A note on the nucleolus of assignment games,
Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis,
pp. 253-260,
July 1998.
-
Yasuko MATSUI,
Tomomi Matsui.
Finding All Maximal Common Independent Sets of Matroids,
Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation,
pp. 54-58,
Aug. 1996.
-
Yasuko MATSUI,
Tomomi Matsui,
Takeaki Unoi.
Finding All the s-t Paths in Acyclic Graphs,
Lecture Notes in Operations Research 1 (ISBN 7-5062-2767-3),
pp. 259-266,
Aug. 1995.
-
Tomomi Matsui.
NP-completeness of Non-adjacency Relations on Some 0-1 Polytopes,
Lecture Notes in Operations Research 1 (ISBN 7-5062-2767-3),
pp. 249-258,
Aug. 1995.
国内会議発表 (査読有り)
-
野中尚貴,
小平行秀,
東梨奈,
松井知己,
高橋篤司,
児玉親亮.
勾配判定法と劣勾配法を用いたマスク最適化,
第34回 回路とシステムワークショップ,
第34回 回路とシステムワークショップ 論文集,
pp. 213-218,
Aug. 2021.
-
半田昌平,
高橋篤司,
中田和秀,
松井知己.
半正定値計画緩和に基づく擬似スティッチを用いたTPLのためのレイアウト分割手法,
第29回 回路とシステムワークショップ 論文集,
pp. 214-219,
May 2016.
-
宮代隆平,
松井知己.
スポーツスケジューリングの近年の展開,
日本スポーツ産業学会 第15回大会,
日本スポーツ産業学会 第15回大会号 --- スポーツのブランディングを考える ---,
pp. 39-40,
July 2006.
国際会議発表 (査読なし・不明)
-
Ryuta Tamura,
Ken Kobayashi,
Yuichi Takano,
Ryuhei Miyashiro,
Kazuhide Nakata,
Tomomi Matsui.
A mixed integer semidefinite programming approach for variable selection avoiding multicollinearity,
The Fifth International Conference on Continuous Optimization (ICCOPT 2016), 2016.,
Aug. 2016.
-
Atsushi Takahashi,
Ahmed Awad,
Yukihide Kohira,
Tomomi Matsui,
Chikaaki Kodama,
Shigeki Nojima,
Satoshi Tanaka.
[Invited] Multi Patterning Techniques for Manufacturability Enhancement in Optical Lithography,
Proc. the 2014 International Conference on Integrated Circuits, Design, and Verification (ICDV 2014),
pp. 117-122,
Nov. 2014.
国内会議発表 (査読なし・不明)
-
小平行秀,
中山晴貴,
野中尚貴,
松井知己,
高橋篤司,
児玉親亮.
シミュレーテッド量子アニーリングを用いたマスク最適化手法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2021-45),
Vol. 121,
No. 277,
pp. 162-167,
Dec. 2021.
-
久保宰,
松井知己.
数直線へのエージェント割当問題,
不確実環境下における意思決定数理の新展開,
Nov. 2021.
-
田中雅人,
松井知己.
サークルグラフの頂点彩色,
第33回位相幾何学的グラフ理論研究集会(TGT33),
Nov. 2021.
-
藤本健太,
松井知己.
トラックとドローンを用いた配送計画問題,
スケジューリング学会シンポジウム,
Sept. 2021.
-
浅井康喜,
松井知己.
車定員削減に伴うスクールバス運行計画の策定,
都市のORサマーセミナー,
Aug. 2021.
-
田中雅人,
松井知己.
サークルグラフの頂点彩色,
日本オペレーションズ・リサーチ学会,
Mar. 2021.
-
黒川幸香,
松井知己.
オッズ問題を解く線形計画法と動的計画法,
「動的決定モデルとその応用」研究部会,
Feb. 2021.
-
槻木澤佑公,
黒川哲明,
松井知己,
髙橋佑典.
スラブヤードにおける頂点彩色問題に基づく山分け問題解法,
日本鉄鋼協会 第177回春季講演大会,
p. 211,
Jan. 2021.
-
東梨奈,
小平行秀,
松井知己,
高橋篤司,
児玉親亮.
ラグランジュ緩和法と境界Flippingによるプロセスばらつきを考慮したピクセルベースマスク最適化手法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2019-105),
Vol. 119,
No. 443,
pp. 65-70,
Mar. 2020.
-
小平行秀,
東梨奈,
松井知己,
高橋篤司,
児玉親亮.
劣勾配法によるプロセスばらつきを考慮したマスク最適化手法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2019-53),
Vol. 119,
No. 282,
pp. 197-202,
Nov. 2019.
-
藤森 友誠,
河瀬 康志,
松井 知己,
塩浦 昭義.
処理速度可変な並列機械でのスケジューリングにおける終了時間とエネルギー量の和の最小化,
第175回アルゴリズム研究発表会,
研究報告アルゴリズム(AL),
vol. 2019-AL-175,
no. 8,
pp. 1-2,
Nov. 2019.
-
田中雅人,
松井知己.
重み付き投票ゲームの最小コア,
日本オペレーションズ・リサーチ学会 2019年秋季研究発表会,
Sept. 2019.
-
東梨奈,
小平行秀,
松井知己,
高橋篤司,
児玉親亮,
野嶋茂樹.
0-1二次計画法によるプロセスばらつきを考慮したモデルベースマスク補正手法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2018-70),
Vol. 118,
No. 334,
pp. 209-214,
Dec. 2018.
-
⻄澤元,
松井 知⼰.
2種類のバスからなるバススケジューリング問題の多項式時間解法,
スケジューリング・シンポジウム 2018,
Sept. 2018.
-
幹 理,
松井 知⼰.
兵器割当問題のラグランジュ緩和法,
スケジューリング・シンポジウム 2018,
Sept. 2018.
-
川名哲裕,
松井知己.
重み付き投票ゲームに関する表現可能性について,
日本オペレーションズ・リサーチ学会 2017年秋季研究発表会,
日本オペレーションズ・リサーチ学会 2017年秋季研究発表会アブストラクト集,
pp. 32-33,
Sept. 2017.
-
田村隆太,
小林健,
高野祐一,
宮代隆平,
中田和秀,
松井知己.
分散拡大要因を考慮した変数選択問題とその混合整数二次計画法による定式化,
日本オペレーションズ・リサーチ学会 2017年春季研究発表会,
Mar. 2017.
-
田村隆太,
小林健,
高野祐一,
宮代隆平,
中田和秀,
松井知己.
多重共線性を除去するための最良部分集合選択,
日本オペレーションズ・リサーチ学会 2017年春季研究発表会,
Mar. 2017.
-
松井知己,
穴太克則.
Newton の不等式を用いたオッズ問題の解析,
待ち行列研究部会,
2017.
-
河瀬 康志,
松井 知己,
宮内 敦史.
モジュラリティ最大化に対する加法的近似解法,
電子情報通信学会総合大会, COMP-ELC 学生シンポジウム,
2017.
-
半田昌平,
高橋篤司,
中田和秀,
松井知己.
半正定値計画緩和に基づくMPLレイアウト分割のための補正項,
電子情報通信学会 2016年総合大会 講演論文集 (A-6-12),
Vol. A,
p. 86,
Mar. 2016.
-
伊豆永 洋一,
Tomomi Matsui,
山本 芳嗣.
A DOUBLY NONNEGATIVE RELAXATION FOR MODULARITY DENSITY MAXIMIZATION (新時代を担う最適化 : モデル化手法と数値計算 : RIMS研究集会報告集),
数理解析研究所講究録,
京都大学,
Vol. 1981,
pp. 84-97,
Jan. 2016.
-
黒木祐子,
松井知己.
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems,
日本オペレーションズリサーチ学会2016年秋季研究発表会,,
2016.
-
長谷俊知,
松井知己.
失点が予想される場面における配球について,
第10回日本統計学会春季集会, ポスターセッション,
2016.
-
松井知己,
濱口貴克.
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties,',
日本オペレーションズリサーチ学会2016年春季研究発表会,
2016.
-
黒木祐子,
松井知己.
ハブ空港配置問題の近似解法,
日本オペレーションズリサーチ学会2016年春季研究発表会,
2016.
-
松井知己.
整数計画におけるラウンディング技法,
第13回 RIMS共同研究「組合せ最適化セミナー」(COSS2016).,
2016.
-
昆野修平,
河瀬康志,
松井知己.
船舶の航行速度最適化問題の解法,
日本オペレーションズリサーチ学会2016年秋季研究発表会,
2016.
-
河瀬康志,
松井知己,
宮内敦史.
モジュラリティ最大化に対する加法的近似解法,
日本オペレーションズリサーチ学会2016年秋季研究発表会,
2016.
-
小平行秀,
児玉親亮,
松井知己,
高橋篤司,
野嶋茂樹,
田中聡.
マスク位置ずれに対する耐性を持つLELECUTトリプルパターニングのためのマスク割り当て手法,
次世代リソグラフィワークショップ予稿集 (NGL2015),
pp. 35-36,
July 2015.
-
滝田潤,
高橋佑典,
昆野修平,
八木祐樹,
宮内敦史,
河瀬康志,
松井知己.
整数計画を用いたナンバーリンクの解法,
DAシンポジウム2015,
2015.
-
松井知己.
スポーツスケジューリング,
スケジューリング・シンポジウム 2015,
2015.
-
松井知己.
半正定値緩和を用いたマルチパターニングリソグラフィ(招待講演,システム設計及び一般),
電子情報通信学会技術研究報告. VLD, VLSI設計技術,
一般社団法人電子情報通信学会,
Vol. 114,
No. 59,
pp. 19,
May 2014.
-
松井知己.
半正定値緩和を用いたマルチパターニングリソグラフィ,
研究報告システムとLSIの設計技術(SLDM),
一般社団法人情報処理学会,
Vol. 2014,
No. 4,
pp. 1-1,
May 2014.
-
小平行秀,
松井知己,
横山陽子,
児玉親亮,
高橋篤司,
野嶋茂樹,
田中聡.
半正定値緩和法を用いたLELECUTトリプルパターニングのためのレイアウト分割手法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2014-6),
Vol. 114,
No. 59,
pp. 27-32,
May 2014.
公式リンク
-
松井知己.
この先は工事中です2 : 安定結婚問題における戦略的操作可能性について(特別講演(1)),
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 2014,
pp. 2-3,
Mar. 2014.
-
松井知己,
[スケ]川 矩義,
宮内 敦史.
1-G-9 分数計画による頂点彩色問題の定式化(離散最適化(2)),
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 2014,
pp. 130-131,
Mar. 2014.
-
宮辺祐太郎,
高橋篤司,
松井知己,
小平行秀,
横山陽子.
ダブルパターニングにおけるリソグラフィECOのためのパターン局所修正法,
VLSI設計技術研究会,
電子情報通信学会技術研究報告 (VLD2013-149),
Vol. 113,
No. 454,
pp. 87-92,
Mar. 2014.
-
山市 貴史,
松井知己.
1-A-2 多期間線形計画法を用いた家庭機器の最適運転計画(電力運用(1)),
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 2014,
pp. 6-7,
Mar. 2014.
-
牧田 純弥,
松井 知己.
2-K-7 スライディングブロックパズルを用いた画像再構築(ワークショップ「娯楽のOR-エンターテイメントの数理」),
日本オペレーションズ・リサーチ学会秋季研究発表会,
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集,
社団法人日本オペレーションズ・リサーチ学会,
Vol. 2011,
No. 28,
pp. 372-373,
Aug. 2011.
-
YAMAGUCHI Daisuke,
MATSUI Tomomi.
Randomized Approximation Scheme for Estimating Critical Path Length of Stochastic PERT Network,
電子情報通信学会総合大会,
電子情報通信学会総合大会講演論文集,
一般社団法人電子情報通信学会,
Vol. 2011,
No. 1,
pp. S15-S16,
Mar. 2011.
その他の論文・著書など
-
松井 知己,
滝田 潤.
LSIの配線問題 -DAシンポジウムの配線問題解法コンテスト-:4.整数計画法を用いた解法,
情報処理,
vol. 59,
no. 3,
pp. 239-242,
Jan. 2021.
-
黒川哲明,
松井知己,
大貝晴俊.
頂点彩色問題の定式化を応用したスラブ山分け問題求解技術開発,
計測自動制御学会論文集,
vol. 55,
No. 5,
pp. 369-378,
2021.
-
黒川 哲明,
松井 知己.
数理計画法による鋼材山分け問題求解技術,
システム/制御/情報,
vol. 64,
no. 5,
pp. 188-193,
May 2020.
-
松井知己.
双対から齧るLovaszのサンドイッチ定理,
オペレーションズ・リサーチ,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 61,
No. 1,
pp. 43-47,
Jan. 2016.
-
松井知己,
穴太 克則.
Newtonの不等式を用いたオッズ問題の解析 (特集 最適停止とその応用),
オペレーションズ・リサーチ,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 60,
No. 3,
pp. 132-137,
Mar. 2015.
-
松井知己.
特集にあたって(<特集>OR研究の過去・現在・未来),
オペレーションズ・リサーチ : 経営の科学,
公益社団法人日本オペレーションズ・リサーチ学会,
Vol. 60,
No. 1,
pp. 9,
Jan. 2015.
学位論文
[ BibTeX 形式で保存 ]
[ 論文・著書をCSV形式で保存
]
[ 特許をCSV形式で保存
]
|