Updated on 2025/10/03

写真a

 
MURAKAMI,Keisuke
 
Organization
Faculty of Business and Commerce Professor
Title
Professor
External link

Degree

  • 博士(情報科学) ( 大阪大学 )

Research Interests

  • Operations Research

  • Combinatorial Optimization

  • Mathematical Programming

Research Areas

  • Social Infrastructure (Civil Engineering, Architecture, Disaster Prevention) / Social systems engineering  / オペレーションズ・リサーチ

  • Informatics / Mathematical informatics

Education

  • Osaka University   Graduate School of Information Science and Technology

    2004.4 - 2010.3

      More details

  • Osaka University   Graduate School of Engineering

    2000.4 - 2004.3

      More details

Research History

  • Kansai University   Faculty of Business and Commerce   Professor

    2024.4

      More details

    Country:Japan

    researchmap

  • Kansai University   Faculty of Business and Commerce   Associate Professor

    2017.4 - 2024.3

      More details

  • Kansai University   Faculty of Business and Commerce   Assistant Professor

    2016.4 - 2017.3

      More details

  • Aoyama Gakuin University   College of Science and Engineering   Assistant Professor

    2012.9 - 2016.3

      More details

  • National Institute of Informatics   Project Reseacher

    2010.4 - 2012.8

      More details

Professional Memberships

  • THE OPERATIONS RESEARCH SOCIETY OF JAPAN

      More details

  • THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS.

      More details

  • THE JAPANESE SOCIETY FOR ARTIFICIAL INTELLIGENCE

      More details

  • スケジューリング学会

      More details

  • THE JAPAN SOCIETY OF MECHANICAL ENGINEERS

      More details

  • THE JAPANESE SOCIETY FOR QUALITY CONTROL

      More details

  • IEEE

      More details

▼display all

Committee Memberships

  • 日本品質管理学会 関西支部   幹事  

    2018 - Present   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会 関西支部   運営委員  

    2018 - Present   

      More details

    Committee type:Academic society

    researchmap

  • スケジューリング学会   理事  

    2018 - Present   

      More details

    Committee type:Academic society

    researchmap

  • 日本機械学会 生産システム部門   運営委員  

    2017.4 - 2021.3   

      More details

    Committee type:Academic society

    researchmap

  • 電気学会 都市マルチエージェント・シミュレーション統合手法検討共同研究会   運営委員  

    2017 - 2018   

      More details

    Committee type:Academic society

    researchmap

  • スケジューリング学会   評議員  

    2014 - 2017   

      More details

    Committee type:Academic society

    researchmap

▼display all

Papers

  • A heuristic algorithm for the cluster editing problem Reviewed

    Keisuke Murakami, Takeaki Uno

    Computational Optimization and Applications   2025.9

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Springer Science and Business Media LLC  

    DOI: 10.1007/s10589-025-00725-5

    researchmap

    Other Link: https://link.springer.com/article/10.1007/s10589-025-00725-5/fulltext.html

  • Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system Reviewed

    Keisuke Murakami

    Computers & Industrial Engineering   141   106270 - 106270   2020.3

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Elsevier BV  

    DOI: 10.1016/j.cie.2020.106270

    researchmap

  • Optimization algorithm for k-anonymization of datasets with low information loss Reviewed

    Keisuke Murakami, Takeaki Uno

    International Journal of Information Security   17 ( 6 )   631 - 644   2018.11

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Springer Science and Business Media LLC  

    DOI: 10.1007/s10207-017-0392-y

    researchmap

    Other Link: http://link.springer.com/content/pdf/10.1007/s10207-017-0392-y.pdf

  • Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem Reviewed

    Keisuke Murakami

    Asia-Pacific Journal of Operational Research   35 ( 04 )   1850021 - 1850021   2018.8

     More details

    Publishing type:Research paper (scientific journal)   Publisher:World Scientific Pub Co Pte Lt  

    The multi-vehicle covering tour problem ([Formula: see text]-CTP) is defined on a graph [Formula: see text], where [Formula: see text] is a set of vertices that can be visited and [Formula: see text] is a set of vertices that must be covered but cannot be visited. The objective of the [Formula: see text]-CTP is to obtain a set of total minimum cost tours on subset of [Formula: see text], while covering all [Formula: see text] by up to [Formula: see text] vehicles. In this paper, we first generalize the original [Formula: see text]-CTP by adding a realistic constraint, and then propose an algorithm for the generalized [Formula: see text]-CTP using a column generation approach. Computational experiments show that our algorithm performs well and outperforms the existing algorithms.

    DOI: 10.1142/s0217595918500215

    researchmap

  • Formulation and algorithms for route planning problem of plug-in hybrid electric vehicles Reviewed

    Keisuke Murakami

    Operational Research   18 ( 2 )   497 - 519   2018.7

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Springer Science and Business Media LLC  

    DOI: 10.1007/s12351-016-0274-5

    researchmap

    Other Link: http://link.springer.com/content/pdf/10.1007/s12351-016-0274-5.pdf

  • A generalized model and a heuristic algorithm for the large-scale covering tour problem Reviewed

    Keisuke Murakami

    RAIRO - Operations Research   52 ( 2 )   577 - 594   2018.4

     More details

    Publishing type:Research paper (scientific journal)   Publisher:EDP Sciences  

    The covering tour problem (CTP) is defined on a graph, where there exist two types of vertices. One is called <italic>visited vertex</italic>, which <italic>can</italic> be visited. The other is called <italic>covered vertex</italic>, which <italic>must</italic> be covered but cannot be visited. Each visited vertex covers a subset of covered vertices, and the costs of edges between visited vertices are given. The objective of the CTP is to obtain a minimum cost tour on a subset of visited vertices while covering all covered vertices. In this paper, we deal with the large-scale CTPs, which are composed of tens of thousands of vertices; in the previous studies, the scales of the instances in the experiments are at most a few hundred vertices. We propose a heuristic algorithm using local search techniques for the large-scale CTP. With computational experiments, we show that our algorithm outperforms the existing methods.

    DOI: 10.1051/ro/2017090

    researchmap

  • A new model and approach to electric and diesel-powered vehicle routing Reviewed

    Keisuke Murakami

    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW   107   23 - 37   2017.11

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1016/j.tre.2017.09.004

    Web of Science

    researchmap

  • A Shift Scheduling Model Introducing Non-Regular Employees for Hotel Restaurants Reviewed

    FUJITA Kazuki, MURAKAMI Keisuke, AMASAKA Kakuro

    The Journal of Japanese Operations Management and Strategy   6 ( 1 )   17 - 33   2016

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:Japanese Operations Management and Strategy Association  

    Research in the field of scheduling has been undergoing a shift in recent years from a focus on nurse scheduling to that on service industry scheduling at hotels and restaurants. Reducing employment costs and figuring out how to put non-regular employments in place to cope with fluctuating demand are critical issues in this sector, particularly when it comes to the scheduling problem to the service industry that depends on human service providers. To cope with these challenges, this paper proposes a shift scheduling model that effectively takes into consideration non-regular employments specializing in food and beverage service in hotel restaurants. It also considers the use of two types of the non-regular employments who are called monthly staff and one-time staff with different working arrangements.

    DOI: 10.20586/joms.6.1_17

    researchmap

  • A Column Generation Model for the Electric and Fuel-engined Vehicle Routing Problem Reviewed

    Keisuke Murakami, Hiroshi Morita

    2015 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2015): BIG DATA ANALYTICS FOR HUMAN-CENTRIC SYSTEMS   1986 - 1991   2015

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1109/SMC.2015.346

    Web of Science

    researchmap

  • Efficient algorithms for dualizing large-scale hypergraphs Reviewed

    Keisuke Murakami, Takeaki Uno

    DISCRETE APPLIED MATHEMATICS   170   83 - 94   2014.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1016/j.dam.2014.01.012

    Web of Science

    researchmap

  • A column generation approach for the multi-vehicle covering tour problem Reviewed

    Keisuke Murakami

    IEEE International Conference on Automation Science and Engineering   2014-   1063 - 1068   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE Computer Society  

    DOI: 10.1109/CoASE.2014.6899457

    Scopus

    researchmap

  • Formulation and heuristic algorithms for multi-chip module substrate testing Reviewed

    Keisuke Murakami

    COMPUTERS & ELECTRICAL ENGINEERING   39 ( 4 )   1049 - 1060   2013.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1016/j.compeleceng.2012.12.020

    Web of Science

    researchmap

  • Efficient algorithms for dualizing large-scale hypergraphs Reviewed

    Keisuke Murakami, Takeaki Uno

    Proceedings of the Workshop on Algorithm Engineering and Experiments   1 - 13   2013

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Society for Industrial and Applied Mathematics Publications  

    DOI: 10.1137/1.9781611972931.1

    Scopus

    researchmap

  • A Local Search Algorithm for Large-Scale MCM Substrate Testing Reviewed

    Keisuke Murakami

    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING   7 ( 4 )   644 - 654   2013

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1299/jamdsm.7.644

    Web of Science

    researchmap

  • Constructing a Model for Selecting Kaizen Actions to Gain Mutual Trust between Logistics Providers and Shippers Reviewed

    OKIHARA Daiki, TAKADA Saki, MURAKAMI Keisuke, AMASAKA Kakuro

    Proceedings of the 14th Asia Pacific Industrial Engineering and Management Systems Conference   2013

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.20586/joms.5.1_74

    researchmap

  • A Genetic Algorithm for Probe Testing Problem on High-density PCB Reviewed

    Keisuke Murakami

    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)   2012

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1109/CEC.2012.6253012

    Web of Science

    researchmap

  • A Matching Model and an Algorithm for k-Anonymity of Large-Scale Data Reviewed

    MURAKAMI Keisuke, UNO Takeaki

    Proceedings of the 15th Korea-Japan Joint Workshop on Algorithms and Computation   2012

     More details

    Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A Heuristic Algorithm for Substrates Testing in MCM Reviewed

    Keisuke Murakami

    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)   121 - 125   2011

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1109/IEEM.2011.6117891

    Web of Science

    researchmap

  • A Two-probe Routing Model and an Algorithm for MCM Substrates Testing Reviewed

    MURAKAMI Keisuke, UMETANI Shunji, MORITA Hiroshi

    Proceedings of International Symposium on Scheduling 2011   2011

     More details

    Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A Method for Generating Robust Schedule under Uncertainty in Processing Time(<Special Issue>TOTAL OPERATIONS MANAGEMENT)

    MURAKAMI Keisuke, MORITA Hiroshi

    International Journal of Biomedical Soft Computing and Human Sciences: the official journal of the Biomedical Fuzzy Systems Association   15 ( 1 )   45 - 50   2010

     More details

    Language:English   Publisher:Biomedical Fuzzy Systems Association  

    We examine a technique for solving the scheduling problem in the flexible flow shop, where the processing time is uncertain. The conventional scheduling method for the flexible flow shop is usually based on afirst-in-flrst-out rule at each stage. However, there is no guarantee that a good solution can be obtained by this method, especially because of the uncertain processing time. In the present study, we attempt to develop a scheduling method that provides a robust schedule against uncertainty in the processing time. In the present paper, we consider a procedure by which to generate robust schedules depending on the degree of uncertainly.

    DOI: 10.24466/ijbschs.15.1_45

    researchmap

  • A Model and a Method for Vehicle Routing Problem with Time Windows under Uncertainty(<Special Issue>Manufacturing Systems Division Conference 2010) Reviewed

    Keisuke MURAKAMI, Hiroshi MORITA

    Transactions of the Japan Society of Mechanical Engineers Series C   76 ( 772 )   3220 - 3229   2010

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Japan Society of Mechanical Engineers  

    DOI: 10.1299/kikaic.76.3220

    researchmap

  • Robust Vehicle Routing under Uncertainty of Customer Demand Reviewed

    MURAKAMI Keisuke, MORITA Hiroshi

    Journal of Japan Industrial Management Association   60 ( 6 )   289 - 296   2010

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:Japan Industrial Management Association  

    This paper discusses a version of the vehicle routing problem with stochastic demand (VRPSD). In this problem, a customer's demand is characterized by a known probability distribution and the customer's actual demand is only revealed when the vehicle reaches the customer location. In such a problem, two approaches are proposed. The objective of the first approach is to find a route sequence that minimizes the expected travel cost. This approach has good performance stochastically; however, when it is applied an upper bound on the travel cost cannot be guaranteed. The second approach is a robust approach implemented through chance-constrained programming. The objective is to find a route sequence that is robust with respect to uncertain demands and, at the same time, minimize the travel cost. When the probability that the vehicle's route is executed as planned is high, the route is said to be robust. In chance-constrained programming, the maximum allowable probability of route failure can be specified by the planner. The chance-constrained approach may have a higher travel cost than the first approach; however, it can guarantee a boundary for worst case performance. In this paper, we employ the chance-constrained approach as a robust method. We formulate VRPSD as a set-covering problem and solve the problem using column generation. We propose an efficient method for designing the route sequences that enable the maximum allowable probability of route failure to be specified.

    DOI: 10.11221/jima.60.289

    CiNii Books

    researchmap

  • Hybrid model for the vehicle routing problem with stochastic demand Reviewed

    Keisuke Murakami, Hiroshi Morita

    International Journal of Applied Management Science   2 ( 3 )   224 - 238   2010

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1504/IJAMS.2010.033566

    Scopus

    researchmap

  • A Method for Generating Robust Schedule under Uncertainty in Processing Time Reviewed

    Keisuke Murakami, Hiroshi Morita

    International Journal of Biomedical Soft Computing and Human Sciences   15 ( 1 )   47 - 52   2009

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    researchmap

  • Robust Scheduling under Uncertainty in Processing Time Reviewed

    MURAKAMI Keisuke, MORITA Hiroshi

    Proceedings of International Symposium on Scheduling 2006   2006

     More details

    Publishing type:Research paper (international conference proceedings)  

    researchmap

▼display all

MISC

  • デマンドバスのルートと乗客へのバス停割当を 同時に考慮した最適運行モデル

    村上啓介, 森田浩

    情報処理学会研究報告   2025 ( 1 )   1 - 6   2025.3

     More details

    Authorship:Lead author  

    researchmap

  • Two-probe Routing Model and Algorithm for Multi-Chip Module Substrates,

    MURAKAMI Keisuke, UMETANI Shunji, MORITA Hiroshi

    Conference for the International Federation of Operational Research Societies   2011

     More details

    Publishing type:Research paper, summary (international conference)  

    researchmap

  • Robust Scheduling of Delivery under Uncertainty on Demands at Delivery Points

    MURAKAMI Keisuke, MORITA Hiroshi

    INFORMS International Puerto Rico   2007

     More details

    Publishing type:Research paper, summary (international conference)  

    researchmap

Presentations

  • An optimization approach for temporary staff scheduling problem in service industry

    Keisuke Murakami

    The 6th World Conference on Production and Operations Management  2022.8 

     More details

    Event date: 2022.8

    researchmap

  • 大規模データに対する情報損失の少ないk-匿名化手法

    村上 啓介, 宇野 毅明

    第111回情報処理学会情報基礎とアクセス技術研究会  2013.7 

     More details

    Event date: 2013.7

    Language:Japanese  

    researchmap

  • マッチングアルゴリズムを用いた大規模データk-匿名化の解法

    村上啓介, 宇野毅明

    第144回情報処理学会アルゴリズム研究会  2013.5 

     More details

    Event date: 2013.5

    Language:Japanese  

    researchmap

  • 最適化を用いた大規模データk-匿名化手法

    村上 啓介, 宇野 毅明

    第88回人工知能基本問題研究会  2013.1 

     More details

    Event date: 2013.1

    Language:Japanese  

    researchmap

  • 304 Vehicle Routing Problem with Time Windows under Uncertainty

    MURAKAMI Keisuke, MORITA Hiroshi

    The Proceedings of Manufacturing Systems Division Conference  2010  The Japan Society of Mechanical Engineers

     More details

    Event date: 2010

    Language:Japanese  

    This paper discusses the vehicle routing problem with time windows and stochastic demands. This problem can be described as the problem of designing least cost routes from one depot to a set of customers. We must design the routes such that each customer is visited only once by exactly one vehicle within a given time interval; all routes start and end at the depot. The customers' demands are characterized by a known probability distribution and a customer's actual demand is only revealed when the vehicle reaches the customer location. When the total demands of customers on a route exceed the capacity of the vehicle, extra path to depot for replenishment must occur. We formulate this problem as set covering problem and we solve this problem by column generation method.

    researchmap

  • 2-D-2 顧客の需要量が不確実な状況下における配送計画問題の研究(整数計画)

    村上 啓介, 梅谷 俊治, 森田 浩

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集  2008.9  公益社団法人日本オペレーションズ・リサーチ学会

     More details

    Event date: 2008.9

    Language:Japanese  

    researchmap

  • 1-C-11 分枝限定法を用いたロバストスケジューリングの研究(離散最適化(2))

    村上 啓介, 森田 浩

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集  2006.9  公益社団法人日本オペレーションズ・リサーチ学会

     More details

    Event date: 2006.9

    Language:Japanese  

    researchmap

  • 7101 Flexible Flowshop Scheduling under Uncertainty in Processing Time

    MORITA Hiroshi, MURAKAMI Keisuke

    The Proceedings of Manufacturing Systems Division Conference  2005  The Japan Society of Mechanical Engineers

     More details

    Event date: 2005

    Language:Japanese  

    We examine the technique for solving the scheduling problem in the flexible flow shop where processing time is uncertain. The conventional scheduling method for flexible flowshop is usually based on first out first in rule on each stage. However, there is no guarantee that a good solution can be obtained by this method, especially for the uncertain processing time. Then, in this study, we consider to express the distribution of uncertain processing time with a normal distribution. Then, we aim to develop the scheduling method which provides a robust solution to the change of the degree of uncertainty.

    researchmap

  • 時間制約付きハブ配置配送計画問題に対するアプローチ

    村上啓介

    計測自動制御学会システム・情報部門学術講演会2016  2016.12 

     More details

  • 充電と時間制約を考慮したプラグインハイブリッド電気自動車の最適経路計画

    村上啓介, 森田浩

    日本オペレーションズ・リサーチ学会2015年秋季研究発表会  2015.9 

     More details

  • ホテルレストランにおける非正規社員を導入したシフトスケジューリング

    藤田一樹, 村上啓介, 天坂格郎

    スケジューリング・シンポジウム2015  2015.9 

     More details

  • 物流業界における長期的な低公害車導入計画モデル

    沖原大樹, 藤田一樹, 村上啓介, 天坂格郎

    スケジューリング・シンポジウム2015  2015.9 

     More details

  • ハイブリッド電気自動車を用いた最適経路計画

    村上啓介, 森田浩

    第59回システム制御情報学会研究発表講演会  2015.5 

     More details

  • 不確実性を考慮した配送計画問題に対するアプローチ Invited

    村上啓介

    システム制御情報学会 サステイナブル・フレキシブル・オートメーション(SFA)研究分科会  2015.5 

     More details

  • 電気自動車とガソリン自動車を併用した配送計画問題に対する解法

    村上啓介, 森田浩

    情報処理学会第101回数理モデル化と問題解決研究発表会  2014.12 

     More details

  • 列生成法と局所探索法を用いた被覆制約付き配送計画問題に対する解法

    村上啓介

    スケジューリング・シンポジウム2014  2014.9 

     More details

  • 時間制約と充電を考慮した電気自動車の最適経路モデルと解法

    村上啓介, 森田浩

    日本オペレーションズ・リサーチ学会2014年秋季研究発表会  2014.8 

     More details

  • 被覆制約付き配送計画問題に対する列生成法

    村上啓介

    日本オペレーションズ・リサーチ学会2014年春季研究発表会  2014.3 

     More details

  • 被覆制約付き配送計画問題に対する列生成法アプローチ

    村上啓介

    第56回自動制御連合講演会  2013.11 

     More details

  • 不確実環境下における配送計画問題およびその他の現実問題に対する最適化技術の適用 Invited

    村上啓介

    日本鉄鋼協会 計測・制御・システム部会若手フォーラム  2013.10 

     More details

  • 最適匿名化手法

    村上啓介, 宇野毅明

    日本オペレーションズ・リサーチ学会2013年春季研究発表会  2013.3 

     More details

  • 被覆制約付き巡回路問題に対する発見的解法

    村上啓介

    スケジューリング・シンポジウム2012  2012.9 

     More details

  • 基板検査問題に対する組合せ最適化アプローチ

    村上啓介

    日本オペレーションズ・リサーチ学会2011年秋季研究発表会  2011.9 

     More details

  • 不確実性を考慮した配送計画問題への列生成法の適用

    村上啓介, 森田浩

    第52回自動制御連合講演会  2009.11 

     More details

  • 顧客の需要量の不確実性を考慮した時間枠制約付き配送計画問題

    村上啓介, 森田浩

    スケジューリング・シンポジウム2009  2009.9 

     More details

  • 顧客の需要量が不確実な状況下におけるロバスト配送計画

    村上啓介, 森田浩

    スケジューリング・シンポジウム2007  2007.9 

     More details

  • 処理時間の不確実な状況下におけるクリティカルパスを用いたロバストスケジュールの列挙法

    村上啓介, 森田 浩

    スケジューリング・シンポジウム2006  2006.10 

     More details

▼display all

Awards

  • 学会賞(学術賞)

    2013.9   スケジューリング学会  

    村上 啓介

     More details

  • 2012年度研究会優秀賞

    2013.6   人工知能学会  

    村上 啓介, 宇野毅明

     More details

Research Projects

  • リアルタイムデータに対応可能な最適化輸送システムの構築

    2018 - 2020

    文部科学省  科学研究費補助金(基盤研究(C)) 

    村上 啓介

      More details

    Authorship:Principal investigator  Grant type:Competitive

    researchmap

  • 利用者状況に応じたコミュニティ電気バスの経路最適化に関する研究

    2018

    公益財団法人大林財団  研究助成 

    村上 啓介

      More details

    Authorship:Principal investigator  Grant type:Competitive

    researchmap

  • 電気自動車による物流とエネルギーの統合管理システムの開発

    2014 - 2017

    文部科学省  科学研究費補助金(基盤研究(B)) 

    森田浩

      More details

    Grant type:Competitive

    researchmap

  • 被覆制約の付いた巡回路問題におけるモデルの整備と解法の開発

    2013 - 2016

    文部科学省  科学研究費補助金(若手研究(B)) 

    村上 啓介

      More details

    Authorship:Principal investigator  Grant type:Competitive

    researchmap