2015
DOI: 10.3126/jist.v20i2.13961
|View full text |Cite
|
Sign up to set email alerts
|

A New Algorithm for Solving Linear Bottleneck Assignment Problem

Abstract: Linear bottleneck assignment problems have wide range of applications in emergency situation like call for fire fighters, ambulances etc. This paper presents a new simple but faster algorithm for solving linear bottleneck assignment problems, so that in such emergent situation efficient and faster decision taking could be make possible. Some examples are also discussed to explain the procedure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…As for linear bottlenecks [19] , to avoid bad factors on image features, Mobile Net-V2 changed the Relu layer that should pass through after convolution to linear layer in the last time of the third convolution operation of residual block to ensure that features are not destroyed.…”
Section: Mobile Net-v2mentioning
confidence: 99%
“…As for linear bottlenecks [19] , to avoid bad factors on image features, Mobile Net-V2 changed the Relu layer that should pass through after convolution to linear layer in the last time of the third convolution operation of residual block to ensure that features are not destroyed.…”
Section: Mobile Net-v2mentioning
confidence: 99%
“…The network can also be studied with inflow-dependent transit time Khanal et al, 2018). Pundir et al (2015) presented an efficient algorithm for solving the linear bottleneck assignment problem. Several researchers have been carried out in production and logistic network independently (Yu & Thapa, 2014).…”
Section: Introductionmentioning
confidence: 99%
“…To this end, the algorithm applies the linear assignment problem (LAP), [32] which it solves via the fast Hungarian algorithm [33] to identify the sphere assignment combination that produces the minimum total travel distance. [34] The collision-prevention algorithm detailed in Shaw et al [34] is then used to move the spheres to the locations within the holding pattern using 11 mW optical tweezers for each sphere while ensuring that none of the spheres collide along the way.…”
mentioning
confidence: 99%