京都大学永持・趙研究室「研究成果 > 修士論文（2000年度以降)」

研究成果 > 修士論文（2000年度以降）

清水雅章, Enumerating tree-like chemical graphs of path frequencies within Given upper and lower bounds (与えられた上下限内のパス頻度をもつ木状化学グラフの列挙)
高明姫, A study on practical speed-up techniques for A* algorithms(A*アルゴリズムに対する実用的高速化手法について)

石塚祐一郎, An exact algorithm for the score-maximizing Tsumego problem (地合最大化詰碁問題に対する厳密解法について)
今田友樹, Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming（動的計画法を用いた外平面的化学グラフの立体異性体の列挙）
清水俊宏, Efficient Unranking Algorithms of Combinations(順位から組合せを生成する効率的なアルゴリズム)
庄冰冰, Generation of Rooted Outerplanar Graphs （根付き外平面グラフの列挙）
辻川貴哉, Orthogonal Drawings for Plane Graphs with Specified Rectangles and Line Width(矩形と線幅の指定された平面グラフの直行描画法)
山田和紀, Discretization and Approximation Schemes for Maximizing the Area Covered by Radius-Variable Disks Inside Simple Polygons (単純な多角形を容器とした円被覆問題に対する離散化と近似スキーム)
好本大児, An approach based on binary tree representations to global search in packing problem（充填問題に対する大域的探索における二分木表現に基づくアプローチ）

石田侑介, Improved algorithms for enumerating tree-like chemical graphs with given path frequency (パス頻度に基づく木状化合物列挙に対する改良型アルゴリズム)
平松正嗣, Approximating Objects with Spheres in Multi-sphere Scheme (多球近似アプローチにおける物体の近似)
金在成, A Study on Algorithms for a Covering Problem in Large-scale Networks（大規模ネットワークにおける被覆問題のアルゴリズムに関する研究）

青田裕史, Algorithms for Maximizing the Area Covered by Radius-variable Disks Inside Convex Polygons (凸多角形内で被覆面積を最大にする円の配置を求めるアルゴリズム)
荒堀洋平, A Branch and Bound Algorithm Based on Canonical Forms for the Strip Packing Problem (ストリップパッキング問題に対する標準形に基づいた分枝限定法)
小林義明, Studies on the Z3-connectivity of 5-edge-connected P5-free Graphs (5辺連結P5フリーグラフのZ3連結性に関する研究)
佐々木方太, Algorithms and Analysis for Optimal Beacon Placement in Large-scale Network (大規模ネットワークの最適ビーコン配置に対するアルゴリズムと解析)
三輪直樹, A study on the Degree-constrained Shortest Tree Problem for Large-scale Networks (大規模ネットワークに対する次数制約付き深さ最小木問題に関する研究)

大嶋達也, A landmark algorithm for the time-dependent shortest path problem（時間依存最短路問題に対するランドマークアルゴリズム）
大田駿介, An algorithm for generating stereoisomers of outerplanar chemical graphs（外平面的化学グラフの立体異性体を生成するアルゴリズム）
川口晃史，Drawings for Clustered Graphs with Specified Areas（面積付きクラスタグラフに対する描画法）
松本一輝，One-dimensional cutting stock problem with setup and open stack constraints（段取り替え数とオープンスタック数に制約を持つ1次元カッティングストック問題）

辛川誠吾，An Algorithm for Enumerating Labeled Trees under Degree and Label-Pair Specifications
剱持光俊，Exact Algorithms for the Strip Packing Problem with Guillotine Constraints
Akira Komiya, A Scatter Search Algorithm for the Multi-Resource Generalized Quadratic Assignment Problem
鳥居宏行，An Iterated Local Search Algorithm for the Dual Network Flow Problem with General Cost Functions
藤原大樹，Enumerating Tree-Like Chemical Structures from Feature Vector
石川明洋，An Iterated Local Search Algorithm for the Multi-Resource Generalized Assignment Problem with Flexible Assignment Cost

今道貴司，Packing Non-Convex Polygons by Iterated Local Search Based on Nonlinear Programming
江崎洋一，A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
大西隆治，Approximating a Single Vehicle Scheduling for Processing the Maximum Number of Jobs in a Straight Line
古賀祐一，Efficient Branch-and-Bound Algorithms for Weighted MAX-2-SAT

西原理，The Relation between Option Pricing and Optimization Problems
橋本英樹，An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows
福永拓郎，Approximation Algorithms for b-Edge Dominating Set Problem and Related Problems
森有功，Heuristic Algorithms for Packing Rectangles with Flexible Edge Length

市川浩也，Metaheuristics Algorithms for the Capacitated Square Cover Problem
久山修司，Two-Phase Heuristics for the Multi-Resource Capacitated Facility Location Problem
祖父江謙介，An Iterated Local Search Algorithm for Vehicle Routing and Scheduling Problems with Convex Time Penalty Functions
辻弘貴，Preprocessing of Data by Weighting for Classifiers
福森匡英，Tabu Search Algorithms for the Quadratic Constraint Satisfaction Problem

Local Search Algorithms for the Two Dimensional Cutting Stock Problem
Formulation and Metaheuristic Algorithms for the Shift Scheduling Problem
A Local Search Algorithm for the Generalized Quadratic Assignment Problem
A Path-Relinking Approach for the Multi-Resource Generalized Assignment Problem
LP-Based Heuristics for the Multi-Resource Capacitated Facility Location Problem
Processing of Real World Data Sets for the Classification Problem

Local Search Heuristics for the Rectangle Packing Problem with General Spatial Costs
A 20/9-Approximation Algorithm for the Minimum Weight 3-Connected Spanning Subgraph Problem
Finding Sigmoid Patterns in Logical Analysis of Data
Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Windows
Feature determination algorithms in the analysis of data
Evaluation of the Parameterized Strategy of Soccer by Markov Chain