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 条
[31]   A dynamic programming approach for storage location assignment planning problem [J].
Wang, Meng ;
Zhang, Ren-Qian .
11TH CIRP CONFERENCE ON INDUSTRIAL PRODUCT-SERVICE SYSTEMS, 2019, 83 :513-516
[32]   Approximability and exact resolution of the multidimensional binary vector assignment problem [J].
Marin Bougeret ;
Guillerme Duvillié ;
Rodolphe Giroudeau .
Journal of Combinatorial Optimization, 2018, 36 :1059-1073
[33]   Solving the flight gate assignment problem using dynamic programming [J].
Florian Jaehn .
Zeitschrift für Betriebswirtschaft, 2010, 80 (10) :1027-1039
[34]   Denovo algorithm for automated glycan structure assignment by MS/MS [J].
Dong, Liang ;
Shi, Bing ;
Li, Yan-Bo ;
Wang, Bing .
Journal of Chinese Mass Spectrometry Society, 2015, 36 (03) :206-216
[35]   Traffic assignment: Methods and simulations for an alternative formulation of the fixed demand problem [J].
Bagdasar, Ovidiu ;
Berry, Stuart ;
O'Neill, Sam ;
Popovici, Nicolae ;
Raja, Ramachandran .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2019, 155 :360-373
[36]   A minimal algorithm for the bounded knapsack problem [J].
Pisinger, D .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (01) :75-82
[37]   The Knapsack Sharing Problem: An Exact Algorithm [J].
Mhand Hifi ;
Slim Sadfi .
Journal of Combinatorial Optimization, 2002, 6 :35-54
[38]   A hybrid algorithm for the unbounded knapsack problem [J].
Poirriez, Vincent ;
Yanev, Nicola ;
Andonov, Rumen .
DISCRETE OPTIMIZATION, 2009, 6 (01) :110-124
[39]   An exact algorithm for the knapsack sharing problem [J].
Hifi, M ;
M'Halla, H ;
Sadfi, S .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (05) :1311-1324
[40]   The knapsack sharing problem: An exact algorithm [J].
Hifi, M ;
Sadfi, S .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (01) :35-54
12345