|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
52738467
線上人數 :
652
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
顯示項目 93436-93445 / 2348685 (共234869頁)
<< < 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 > >>
每頁顯示[10|25|50]項目
| 朝陽科技大學 |
2016-08-01 |
A branch-and-bound algorithm for identical parallel-machine total tardiness scheduling problem with preemption
|
廖經芳; Liaw, Ching-Fang |
| 國立交通大學 |
2014-12-08T15:32:51Z |
A branch-and-bound algorithm for makespan minimization in differentiation flow shops
|
Liu, Yen-Cheng; Fang, Kuei-Tang; Lin, Bertrand |
| 亞洲大學 |
1995 |
A branch-and-bound algorithm for minimum-comparison sorting
|
C. T. Yang;S. S. Tseng;B. M. L. Lin |
| 朝陽科技大學 |
1999 |
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
|
廖經芳; Ching-Fang Liaw |
| 華夏技術學院 |
1988-12 |
A Branch-and-Bound Approach with Critical Path Underestimate to Distributed Task Assignment
|
徐俊傑 |
| 臺大學術典藏 |
2018-07-05T01:22:20Z |
A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint
|
Chen, Gen-Huey; Yur, Jyr-Shiarn; Chen, Gen-Huey; Yur, Jyr-Shiarn |
| 國立臺灣大學 |
1990-06 |
A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint
|
Chen, Gen-Huey; Yur, Jyr-Shiarn |
| 臺大學術典藏 |
2020-05-04T07:54:28Z |
A Branch-and-Bound-with-Underestimates Algorithm for the Task Assignment Problem with Precedence Constraint.
|
GEN-HUEY CHEN; Yur, Jyh-Shiarn; Chen, Gen-Huey; Chen, Gen-Huey;Yur, Jyh-Shiarn |
| 國立政治大學 |
1994 |
A Branch-and-Cut Optimizer for Process Planning
|
劉明郎;N. V. Sahinidis |
| 國立臺灣科技大學 |
2017 |
A Branch-and-Price Approach for the Open Location Routing Problem with Time Windows
|
Asri, Arlita Nurmaya |
顯示項目 93436-93445 / 2348685 (共234869頁)
<< < 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 > >>
每頁顯示[10|25|50]項目
|
