研究成果 > 修士論文（1990年度〜1999年度）
1999年度
- A 3-Flip Neighborhood Local Search for the Set Covering Problem
- Construction of Decision Trees Considering Errors in Data
1998年度
- Logical Analysis of Data by Decomposable Boolean Functions
- A Fast Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
- An Approximation Algorithm to the Minimum k-Way Cut Problem in Graphs
- Dividing Multiple Resources in a Graph into Connected Components
- Logical and Regression Analysis of Economic Indicators
1997年度
- Augmenting a Submodular and Posi-mokular Set Function by a Multigraph
- Logical Analysis of Data by Positive Decision Trees
- Optimum Asset Allocation based on Regression Models of Asset Prices
- A Variable Depth Search Algorithm for the Generalized Assignment
1996年度
- Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously in Undirected Graphs
- Application of Genetic Algorithms to the Home Delivery Scheduling Problem under Changing Environment
- A Simplified O(nm) Time Edge-Splitting Algorithm in Underected Graphs
- General Purpose Heuristic Algorithms for Combinatorial Problems via CSP(Constraint Satisfaction Problem)
- グラフ彩色問題に対する充足可能性アルゴリズムについて
1995年度
- An Exact Algorithm for the Maximum Clique Problem
- Alternating Proximal-Projection Methods for Finding a Zero of Maximal Monotone Operators
- Single-Vehicle Scheduling Problem on a Tree with Depth-First Routing
- Boolean Approaches to the Classification of Data
1994年度
- Interior Proximal Point Algorithm Using Gauss-Seidal Method
- Simple Approximation Algorithm for the Multicommodity Flow Problem with Path Length Constraints
- Horn Extensions of Partially Defined Boolean Functions
- Approximate Minimum Multiway Cuts in Directed Networks
1993年度
- A Primal-Dual Proximal Point Algorithm for Monotone Variational Inequality Problems
- A Tight Upper Bound on the Number of Small Cuts in Undirected Networks
- Structural Studies on Positive Boolean Functions
- A Multisplitting Method for Symmetric Linear Complementarity Problems
1992年度
- A Faster Algorithm for the Minimum Capacity Cut Problem of Undirected Networks
- Parallel Relaxation Method for Quadratic Programming Problems with Interval Constraints
- A Polynomial Approximation Algorithm for the Separable Convex Minimum Cost Flow Problem
- Portfolio Selection Problems with Some Correlation Structures of Asset Returns
- Genetic Algorithms for Solving Some Combinatorial Optimization Problems
1991年度
- A Bottleneck-Based Heuristic Algorithm for the Job Shop Scheduling Problem to Minimize Total Tardiness
- A Successive Over-Relaxation Method for Quadratic Programming Promlems with Interval Constraints
- A Model of Time-Varying Flows on a Congested Multidestination Network
- A Branch and Bound Method for Graph Partitioning with Constraint on Set Sizes
- Optimal Scheduling Policies in Time Sharing Services Systems
1990年度
- Optimal Scheduling for Multiple Servers Queueing Systems with Customer Deadline
- The Complexity of Identifying a Boolean Function
- A Globally Convergent Newton Method for Solving Monotone Variational Inequalities
- A Constraint-Based Database Model for Cooperative Transactions
- A Practical Decomposition Approach to Large-Scale Nonlinear Programming Problems