Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…To reduce complexity, the use of the branch and bound method [22] can be proposed, which is used to find optimal solutions to various optimization problems, especially discrete and combinatorial optimization. In essence, the method is a variation of exhaustive search with elimination of subsets of feasible solutions that obviously do not contain optimal solutions.…”
Section: Computational Complexity Of Membership Function Settingsmentioning
confidence: 99%
“…To reduce complexity, the use of the branch and bound method [22] can be proposed, which is used to find optimal solutions to various optimization problems, especially discrete and combinatorial optimization. In essence, the method is a variation of exhaustive search with elimination of subsets of feasible solutions that obviously do not contain optimal solutions.…”
Section: Computational Complexity Of Membership Function Settingsmentioning
confidence: 99%