<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-23T09:31:55Z</responseDate><request verb="GetRecord" identifier="oai:repository.kulib.kyoto-u.ac.jp:2433/192221" metadataPrefix="dim">https://repository.kulib.kyoto-u.ac.jp/server/oai/request</request><GetRecord><record><header><identifier>oai:repository.kulib.kyoto-u.ac.jp:2433/192221</identifier><datestamp>2021-09-05T16:37:49Z</datestamp><setSpec>com_2433_48884</setSpec><setSpec>col_2433_59280</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">永持, 仁</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">太田, 快人</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">髙橋, 豊</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en:1">Aleksandar Shurbevski</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="alternative" lang="ja:1">アレクサンダル シュルベフスキ</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-12-03T00:39:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-12-03T00:39:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2014-09-24</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="granted">2014-09-24</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/2433/192221</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="grantid">14301甲第18621号</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="selfDOI">10.14989/doctor.k18621</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="degreegrantorID" lang="null:1">14301</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="ja">京都大学 (Kyoto University)</dim:field>
   <dim:field mdschema="dc" element="publisher" qualifier="alternative" lang="ja">京都大学</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">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.</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">[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.</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">[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.</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">-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.</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">[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.</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">-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.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combinatorial Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Sequencing Problems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Routing Problems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Approximation Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Approximation Framework</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Bipartite Graphs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Traveling Salesman</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="ndc">007</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">An Approximation Framework for Sequencing Problems with Bipartite Structure</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="ja">二部分構造を持つ順序付け問題に対する近似方式</dim:field>
   <dim:field mdschema="dc" element="type">doctoral thesis</dim:field>
   <dim:field mdschema="dc" element="type" qualifier="niitype">Thesis or Dissertation</dim:field>
   <dim:field mdschema="dc" element="textversion">ETD</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreegrantor" lang="ja:1">京都大学</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeuniversitycode">0048</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreelevel">新制・課程博士</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreediscipline" lang="ja">博士(情報学)</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreereportnumber">甲第18621号</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreenumber">情博第545号</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreekucallnumber">新制||情||96(附属図書館)</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeserialnumber">31521</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeaffiliation">京都大学大学院情報学研究科数理工学専攻</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeexamcommittee">(主査)教授 永持 仁, 教授 太田 快人, 教授 髙橋 豊</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeprovision">学位規則第4条第1項該当</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreediscipline-en" lang="en">Doctor of Informatics</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreegrantor-en" lang="en:1">Kyoto University</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreeObjectType">DFAM</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="name" lang="ja:1">djohk00545.pdf</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="name" lang="ja:2">yjohk00545.pdf</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="typeFlag" lang="ja:1">fulltext</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="typeFlag" lang="ja:2">abstract</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="format" lang="ja:1">application/pdf</dim:field>
   <dim:field mdschema="dc" element="file" qualifier="format" lang="ja:2">application/pdf</dim:field>
   <dim:field mdschema="dcterms" element="accessRights">open access</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Type" lang="null:1">Supervisor</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Type" lang="null:2">Supervisor</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Type" lang="null:3">Supervisor</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Name" lang="ja:1">永持, 仁</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Name" lang="ja:2">太田, 快人</dim:field>
   <dim:field mdschema="jpcoar" element="contributor" qualifier="Name" lang="ja:3">髙橋, 豊</dim:field>open.access</dim:dim></metadata></record></GetRecord></OAI-PMH>