Skip to main navigation
Skip to search
Skip to main content
University of Canberra Research Portal Home
Search content at University of Canberra Research Portal
Home
Profiles
Research output
Projects
Press/MediaIO
Activities
Research units
Prizes
Student theses
Impacts
A Binary Equilibrium Optimization Algorithm for 0–1 Knapsack Problems
Mohamed Abdel-Basset
, Reda Mohamed
, Seyedali Mirjalili
Research output
:
Contribution to journal
›
Article
›
peer-review
69
Link opens in a new tab
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Binary Equilibrium Optimization Algorithm for 0–1 Knapsack Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Transfer Function
100%
Knapsack Problem
100%
Equilibrium Optimization Algorithm
100%
Small Media
50%
V-shaped
50%
Equilibrium Optimizer
50%
Statistical Analysis
25%
Sift
25%
Benchmark Dataset
25%
S-shape
25%
Penalty Function
25%
Binary Problems
25%
Large-scale Testing
25%
Infeasible Solution
25%
Binary Version
25%
Continuous Optimization Problem
25%
Discrete Problem
25%
Knapsack
25%
Binary Algorithm
25%
Repair Algorithm
25%
Binary Equilibrium Optimizer
25%
Continuous Equilibrium
25%
Feasible Solution
25%
Equilibrium Optimization
25%
Computer Science
Optimization Algorithm
100%
Transfer Function
100%
Knapsack Problem
100%
Experimental Result
25%
Optimization Problem
25%
Case Study
25%
Continuous Optimization
25%
Knapsack
25%
Feasible Solution
25%
Penalty Function
25%
Engineering
Transfer Function
100%
Knapsack Problem
100%
Experimental Result
25%
Optimisation Problem
25%
Penalty Function
25%
Optimal Value
25%
Scale Test
25%
Feasible Solution
25%
Good Choice
25%
Mathematics
Transfer Function
100%
Combinatorial Optimization
100%
Concludes
25%
Statistical Analysis
25%
Good Choice
25%
Feasible Solution
25%