跳至主導覽
跳至搜尋
跳過主要內容
國立成功大學 首頁
English
中文
首頁
概要
研究單位
研究成果
專案
學生論文
設備
獎項
活動
按專業知識、姓名或所屬機構搜尋
查看斯高帕斯 (Scopus) 概要
王 逸琳
教授
資訊管理研究所
https://orcid.org/0000-0003-1607-8286
電話
886 6 2757575 ext 53123
電子郵件
ilinwang
mail.ncku.edu
tw
h-index
370
引文
9
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
2003
2022
每年研究成果
概覽
指紋
網路
專案
(22)
研究成果
(19)
類似的個人檔案
(6)
監製作品
(20)
指紋
查看啟用 I-Lin Wang 的研究主題。這些主題標籤來自此人的作品。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Engineering & Materials Science
Integer programming
100%
DNA
36%
Electronic Waste
35%
Costs
33%
Linear programming
32%
Scheduling
31%
Polynomials
29%
Experiments
29%
Traveling salesman problem
27%
Semiconductor materials
27%
Bicycles
26%
Unmanned aerial vehicles (UAV)
26%
Chromosomes
26%
Air pollution
26%
Simulated annealing
23%
Heuristic algorithms
23%
Patient rehabilitation
21%
Trucks
21%
Pavements
21%
Electric vehicles
21%
Logistics
20%
Compaction
19%
DNA sequences
14%
Interchanges
14%
Distillation
13%
Base stations
13%
Mathematical programming
13%
Random forests
12%
Recycling
11%
Quality of service
9%
Availability
8%
Decomposition
8%
Data transfer
7%
Launching
6%
Data acquisition
6%
Planning
6%
Landing
5%
Cones
5%
Business & Economics
Shortest Path
63%
Shortest Path Problem
43%
Node
40%
Vehicle Fleet
34%
Valid Inequalities
33%
Motorcycle
30%
Parallel Machines
29%
Semiconductor Manufacturing
29%
Distribution Costs
28%
Electric Vehicle
28%
Local Search
27%
Redistribution
26%
Distribution Network
26%
Least Squares
25%
Generator
24%
Metropolitan Areas
23%
Mixed Integer Program
20%
Heuristics
18%
Hub-and-spoke Network
17%
Time Windows
13%
Parking
13%
Mathematical Model
13%
Scheduling Problem
11%
Mixed Integer Programming
11%
Network Flow
10%
Costs
10%
Location Problem
8%
Synergy
8%
Business Model
8%
Decomposition
8%
Train
7%
Makespan
7%
Due Dates
7%
Energy Consumption
7%
Polynomials
7%
Pollution
6%
Manufacturing Process
6%
Planning
6%
Schedule
6%
Numerical Analysis
6%
Destination
5%
Network Flow Problem
5%
Airline Networks
5%
Linear Programming
5%
Operations Research
5%
Manufacturing Network
5%
Proportionality
5%
Mathematics
Parsimony
63%
Haplotype
55%
Distribution Network
35%
Network Algorithms
34%
Compaction
33%
Greedy Heuristics
32%
Simplex Algorithm
31%
Logistics
23%
Vertex of a graph
20%
Arc of a curve
17%
Generator
16%
Costs
16%
Strategy
16%
Heuristic algorithm
13%
Computational Experiments
12%
Network Flow
12%
Demand Forecasting
10%
Integer Linear Programming
10%
Quality of Service
8%
Rack
8%
Sufficient
8%
Random Forest
8%
Historical Data
8%
Manufacturing
7%
Recombination
6%
Directly proportional
6%
Availability
6%
Distinct
6%
Computational Results
5%
Graphics
5%
Capacity Constraints
5%
Model
5%
Random Networks
5%
