General bottleneck assignment problem and its algorithm

被引：0

作者：

Zhu, Xiao-Xia ^{[1
]}

Wang, Rui-Jiang ^{[2
]}

Du, Gang-Po ^{[2
]}

机构：

[1] Hebei Univ Sci & Technol, Coll Sci, Shijiazhuang 050018, Peoples R China

[2] Hebei Univ Sci & Technol, Coll Econ & Management, Shijiazhuang 050018, Peoples R China

来源：

PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2007年

关键词：

dynamic programming; bottleneck assignment; threshold;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

For the 1-2 Dim bottleneck problems, some researcher had got results. Based on these work, we discussed a general bottleneck assignment problem in this paper. For this problem, we present a dynamic algorithm with threshold.

引用

页码：2572 / +

页数：2

共 50 条

[41] An exact algorithm for the subset sum problem [J].

Soma, NY ;

Toth, P .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (01) :57-66

[42] A General Linea-Quadratic Optimization Problem [J].

Y. Y. Fan ;

R. E. Kalaba .

Journal of Optimization Theory and Applications, 2005, 127 :485-496

[43] A general linea-quadratic optimization problem [J].

Fan, YY ;

Kalaba, RE .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2005, 127 (03) :485-496

[44] Robust contour matching via the order-pre serving assignment problem [J].

Scott, Clayton ;

Nowak, Robert .

IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (07) :1831-1838

[45] A stochastic model for the patient-bed assignment problem with random arrivals and departures [J].

Mojtaba Heydar ;

Małgorzata M. O’Reilly ;

Erin Trainer ;

Mark Fackrell ;

Peter G. Taylor ;

Ali Tirdad .

Annals of Operations Research, 2022, 315 :813-845

[46] A stochastic model for the patient-bed assignment problem with random arrivals and departures [J].

Heydar, Mojtaba ;

O'Reilly, Malgorzata M. ;

Trainer, Erin ;

Fackrell, Mark ;

Taylor, Peter G. ;

Tirdad, Ali .

ANNALS OF OPERATIONS RESEARCH, 2022, 315 (02) :813-845

[47] Online and Offline Model for Housekeeping Order Assignment Based on Dynamic Programming Algorithm [J].

Shi, Yongkun ;

Li, Jiangkuan ;

Sun, Jiaquan ;

Lu, Cunhao ;

Chen, Jian ;

Sun, Xiaoguang .

APPLIED SCIENCES-BASEL, 2024, 14 (02)

[48] An Efficient Pre-assignment Routing Algorithm for Flip-Chip Designs [J].

Lin, Chung-Wei ;

Lee, Po-Wei ;

Chang, Yao-Wen ;

Shen, Chin-Fang ;

Tseng, Wei-Chih .

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2012, 31 (06) :878-889

[49] PhosSA: Fast and accurate phosphorylation site assignment algorithm for mass spectrometry data [J].

Fahad Saeed ;

Trairak Pisitkun ;

Jason D Hoffert ;

Sara Rashidian ;

Guanghui Wang ;

Marjan Gucek ;

Mark A Knepper .

Proteome Science, 11

[50] A novel resampling algorithm based on the knapsack problem [J].

Bacak, Ahmet ;

Hocaoglu, Ali Koksal .

SIGNAL PROCESSING, 2020, 170

← 1 2 3 4 5 →