1. Kyoto University Research Information Repository
2. 002　学位論文
3. 140 博士(情報学)

このアイテムのアクセス数: 433

Permalink : https://doi.org/10.14989/doctor.k18621

タイトル:	An Approximation Framework for Sequencing Problems with Bipartite Structure
その他のタイトル:	二部分構造を持つ順序付け問題に対する近似方式
著者:	Aleksandar Shurbevski
著者名の別形:	アレクサンダル シュルベフスキ
キーワード:	Combinatorial Optimization Sequencing Problems Routing Problems Approximation Algorithms Approximation Framework Bipartite Graphs Traveling Salesman
発行日:	24-Sep-2014
出版者:	京都大学 (Kyoto University)
学位授与大学:	京都大学
学位の種類:	新制・課程博士
取得分野:	博士(情報学)
報告番号:	甲第18621号
学位記番号:	情博第545号
metadata.dc.date.granted:	2014-09-24
請求記号:	新制||情||96(附属図書館)
整理番号:	31521
研究科・専攻:	京都大学大学院情報学研究科数理工学専攻
論文調査委員:	(主査)教授 永持 仁, 教授 太田 快人, 教授 髙橋 豊
学位授与の要件:	学位規則第4条第1項該当
著作権等:	List of the Author's Work -Journal Publications [1] Aleksandar Shurbevski, Yoshiyuki Karuno, and Hiroshi Nagamochi. A dynamic programming based improvement heuristic for a repetitive routing problem of grasp-and-delivery robots. Journal of Advanced Mechanical Design, Systems, and Manufacturing, Special Issue on ISS 2011: Advanced Production Scheduling, 6(5):611-621, 2012. doi:10.1299/jamdsm.6.611 Copyright © 2012 The Japan Society of Mechanical Engineers. Note: Part of Chapter 4 (edited August, 2014), including some of the results presented in Section 4.2.1, are based on results which originally appear in this article. [2] Yoshiyuki Karuno, Hiroshi Nagamochi, and Aleksandar Shurbevski. Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards. Journal of the Operations Research Society of Japan, 55(3):181-191, 2012. Copyright © 2012 The Operations Research Society of Japan. Note: Part of Chapter 5 (edited August, 2014), including some of the results presented in Section 5.3, are based on results which originally appear in this article. [3] Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno. Better approximation algorithms for grasp-and-delivery robot routing problems. IEICE Transactions on Information and Systems, E96-D(3):450-456, 2013. doi:10.1587/transinf.E96.D.450 Copyright © 2013 The Institute of Electronics, Information and Communication Engineers. Note: Part of Chapter 5 (edited August, 2014), including some of the results presented in Section 5.3.1, are based on results which originally appear in this article. -Refereed Conference Proceedings [4] Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno. Approximating the bipartite TSP and its biased generalization. In Sudebkumar Prasant Pal and Kunihiko Sadakane, editors, WALCOM 2014, volume 8344 of Lecture Notes in Computer Science, pages 56-67, Springer International Publishing, 2014. doi:10.1007/978-3-319-04657-0_8 Copyright © 2014 Springer International Publishing Switzerland. Note: Part of Chapter 3 (edited August, 2014), including some of the results presented in Section 3.4, are based on results which originally appear in this article. [5] Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno. The repetitive routing problem revisited. In 11th International Conference of the Society for Electronics, Telecommunications, Automatics and Informatics (ETAI 2013), CD-ROM Proceedings, paper A1-2, 2013. Note: Part of Chapter 3 (edited August, 2014), including some of the results presented in Section 3.4, are based on results which originally appear in this article. -Conference Proceedings without Peer Review [6] Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno. Improved approximation ratio algorithms for grasp-and-delivery robot routing problems. In The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), pages 9-16, 2012. Note: Part of Chapter 5 (edited August, 2014), including some of the results presented in Section 5.3.1, are based on results which originally appear in this article.
DOI:	10.14989/doctor.k18621
URI:	http://hdl.handle.net/2433/192221
出現コレクション:	140 博士(情報学)

このリポジトリに保管されているアイテムはすべて著作権により保護されています。