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 条

[21] Constant factor approximations for the hotlink assignment problem [J].

Jacobs, Tobias .

Algorithms and Data Structures, Proceedings, 2007, 4619 :188-200

[22] Generalized a bottleneck routing problem: dynamic programming and the start point optimization [J].

Chentsov, Alexei A. ;

Chentsov, Alexander G. ;

Sesekin, Alexander N. .

IFAC PAPERSONLINE, 2018, 51 (32) :373-377

[23] Assignment problem for system with precedence relationships among elements [J].

Kaji, T ;

Ohuchi, A .

ELECTRICAL ENGINEERING IN JAPAN, 1997, 121 (02) :54-62

[24] The minimum range assignment problem on linear radio networks [J].

Clementi, AEF ;

Ferreira, A ;

Penna, P ;

Perennes, S ;

Silvestri, R .

ALGORITHMICA, 2003, 35 (02) :95-110

[25] Exact Algorithms and Bounds for the Dynamic Assignment Interdiction Problem [J].

Sefair, Jorge A. ;

Smith, J. Cole .

NAVAL RESEARCH LOGISTICS, 2017, 64 (05) :373-387

[26] A Sequential Assignment Match Process with General Renewal Arrival Times [J].

Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva ;

84105, Israel .

Probab. Eng. Inf. Sci., 3 (475-492)

[27] A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem [J].

Nagata, Yuichi ;

Ono, Isao .

COMPUTERS & OPERATIONS RESEARCH, 2018, 90 :60-71

[28] Approximability and exact resolution of the multidimensional binary vector assignment problem [J].

Bougeret, Marin ;

Duvillie, Guillerme ;

Giroudeau, Rodolphe .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (03) :1059-1073

[29] An exact method with variable fixing for solving the generalized assignment problem [J].

Posta, Marius ;

Ferland, Jacques A. ;

Michelon, Philippe .

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 52 (03) :629-644

[30] An exact method with variable fixing for solving the generalized assignment problem [J].

Marius Posta ;

Jacques A. Ferland ;

Philippe Michelon .

Computational Optimization and Applications, 2012, 52 :629-644

← 1 2 3 4 5 →