跳至主導覽
跳至搜尋
跳過主要內容
國立成功大學 首頁
English
中文
在 國立成功大學 搜尋內容
首頁
概要
研究單位
研究成果
專案
學生論文
設備
獎項
活動
查看斯高帕斯 (Scopus) 概要
王 逸琳
教授
資訊管理研究所
https://orcid.org/0000-0003-1607-8286
電話
886 6 2757575 ext 53123
電子郵件
ilinwang
mail.ncku.edu
tw
h-index
430
引文
9
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
2003
2026
每年研究成果
概覽
指紋
網路
專案
(22)
研究成果
(27)
類似的個人檔案
(6)
監製作品
(20)
指紋
查看啟用 I-Lin Wang 的研究主題。這些主題標籤來自此人的作品。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Computer Science
Acyclic Network
36%
Business Function
36%
Candidate Haplotype
36%
Column Generation
18%
Computation Time
18%
Computational Efficiency
18%
Computational Experiment
75%
Customer Demand
36%
Dispatching Rule
27%
Elementary Procedure
24%
Equivalent Network
36%
Excess Capacity
18%
Feasible Solution
21%
First-in-First-Out
18%
Greedy Algorithm
18%
Heuristic Algorithm
18%
Heuristic Solution
18%
Human Resource
18%
Integer Programming
87%
Integer-Linear Programming
12%
Mathematical Programming
12%
Mathematical Property
36%
Mathematical Structure
12%
Maximal Clique
12%
Mixed Integer Programming
100%
multi agent
18%
Multiple Processor
18%
Network Flow Model
36%
Optimisation Objective
36%
Optimization Technique
18%
Pair Shortest Path
36%
Pair Shortest Path Problem
36%
Parallel Machine
36%
Programming Method
12%
Programming Model
93%
Quadratic Programming
36%
Quality of Service
12%
Random Decision Forest
12%
Recycling Process
36%
Route Optimization
36%
Routing Decision
18%
Routing Problem
63%
Scheduling Problem
72%
Search Heuristic
54%
Semidefinite Programming
12%
Sharing System
72%
Simplex Algorithm
36%
Solution Method
18%
Unmanned Aerial Vehicle
36%
Vehicle Routing
36%
Keyphrases
All-pairs Shortest Paths
18%
Autonomous Trucks
36%
Batch Release
36%
Bicycle-sharing Systems
18%
Bike
36%
Bike Repositioning
36%
Bike-sharing System
36%
Carrier Vehicle
36%
Commuting
18%
Compaction
36%
Courier
24%
Courier Service
36%
Crowdshipping
36%
Customer Segments
18%
Duration Constraints
36%
Dynamic Repositioning
36%
Electric Vehicle Fleet
36%
Electrical Vehicle
36%
Electronic Waste (E-waste)
36%
Eligibility Requirements
36%
Fast Heuristic
36%
Genotype Data
36%
Improved System
18%
Initial Allocation
18%
Job Batch
24%
Latent Segmentation
18%
Machine Eligibility
36%
Mathematical Properties
36%
Network Localization
36%
Network Simplex Algorithm
36%
Number of Trips
18%
Operation Research Model
18%
Operational Environment
18%
Parallel Batch
36%
Problem Reduction
36%
Proportionality Constraints
18%
Public Bicycle Sharing System
36%
Pure Parsimony
36%
Recharging Strategy
36%
Rehabilitation Costs
36%
Rolling Horizon Heuristic
18%
Shortest Path Problem
27%
Single-source Shortest Paths
18%
Smart Locker
36%
Tardy Jobs
24%
Transit Data
18%
Truck Fleet
36%
Truck Platooning
18%
UAV Routing
36%
Unrelated Parallel Machines
36%
Engineering
Aerodynamic Drag
7%
Capacity Constraint
6%
Clustering Problem
18%
Computational Analysis
7%
Computational Time
18%
Distribution Network
36%
Economic Benefit
7%
Elementary Procedure
18%
Environmental Benefit
7%
Environmentally Sustainable Transport
36%
Equivalent Network
9%
Feasible Solution
9%
Flow Model
45%
Flow Problem
18%
Freight Transportation
7%
Logistics Network
36%
Manufacturing Process
9%
Mathematical Property
6%
Minimum Total Cost
36%
Mixed Integer Linear Programing
36%
Model Scale
7%
Network Cost
9%
Network Model
18%
Nodes
36%
Pavement
36%
Platooning
36%
Polynomial Time
15%
Programming Model
52%
Route Optimization
7%
Routing Problem
7%
Scheduling Decision
7%
Simplex
36%
Simulated Annealing Algorithm
36%
State-of-the-Art Method
7%
Unmanned Aerial Vehicle
18%
