Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,322 papers from all fields of science
Search
Sign In
Create Free Account
Linear bottleneck assignment problem
In combinatorial optimization, a field within mathematics, the linear bottleneck assignment problem (LBAP) is similar to the linear assignment…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Assignment problem
Loss function
Quadratic bottleneck assignment problem
Weapon target assignment problem
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
THE EFFECT OF FIRETRUCK RELOCATIONS ON THE PERFORMANCE OF FIREFIGHTER SERVICE PROVIDERS A research about the relationship between executing relocations and the performance of the firefighter service…
Moumna Rahou
2017
Corpus ID: 2638500
In life-threatening situations where every second counts, the timely arrival of firefighter services at the emergency scene can…
Expand
2016
2016
A Linear Bottleneck Assignment Problem Using Improved Threshold Algorithm
Sang-Un Lee
2016
Corpus ID: 124608004
2015
2015
A New Algorithm for Solving Linear Bottleneck Assignment Problem
P. Pundir
,
Sandeep Kumar Porwal
,
Brijesh Singh
2015
Corpus ID: 61756279
Linear bottleneck assignment problems have wide range of applications in emergency situation like call for fire fighters…
Expand
2015
2015
AN ALGORITHM FOR SOLVING INTUITIONISTIC FUZZY LINEAR BOTTLENECK ASSIGNMENT PROBLEMS
A. Gani
,
J. Kavikumar
,
V. Mohamed
2015
Corpus ID: 28632585
The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the…
Expand
2013
2013
Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm
Sang-Un Lee
2013
Corpus ID: 121489430
본 논문은 선형 병목할당 문제의 최적해를 간단히 찾는 알고리즘을 제안하였다. 일반적으로 병목할당 문제의 최적해는 한계 또는 증대경로 알고리즘으로 구한다. 제안된 알고리즘은 2…
Expand
1992
1992
Solving linear bottleneck assignment problems via strong spanning trees
R. Armstrong
,
Zhiying Jin
Operations Research Letters
1992
Corpus ID: 121418913
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE