2020
DOI: 10.1109/tla.2020.9398639
|View full text |Cite
|
Sign up to set email alerts
|

A Brief History of Heuristics: from Bounded Rationality to Intractability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 89 publications
0
2
0
Order By: Relevance
“…However, according to [12], even considering all the computational apparatus currently available, the BFA has its application restricted to cases where TS ≤ 10 7 , a limit that is exceeded for small values, such as 𝑁 = 160 and 𝐿 = 3, for example. It is the main focus of the Computational Intractability theme, as exposed in [46].…”
Section: Discretizationmentioning
confidence: 99%
“…However, according to [12], even considering all the computational apparatus currently available, the BFA has its application restricted to cases where TS ≤ 10 7 , a limit that is exceeded for small values, such as 𝑁 = 160 and 𝐿 = 3, for example. It is the main focus of the Computational Intractability theme, as exposed in [46].…”
Section: Discretizationmentioning
confidence: 99%
“…In addressing inconsistencies between the stratification variable and a study variable, [14] proposed a method utilizing two models. Over the past few decades, methods have been categorized predominantly as approximation or optimization techniques [15]. Notably, an exact technique for resource allocation was presented in [17], utilized by the BRKGA (Biassed Random Key Genetic Algorithm) and GRASP (Greedy Randomised Adaptive Search Procedure) algorithms outlined in [16].…”
Section: Introductionmentioning
confidence: 99%