The empirical testing of metaheuristic solution methods for optimization applications should
consider the effect of the underlying structure of the optimization problem test instances …

In this paper, we apply Instance Space Analysis (ISA) to study the two-dimensional bin-
packing problem. We consider classical and newly-generated instances to test the …

Several articles dealing with the generation of hard 0‐1 knapsack problems (KPs) have
given rise to 13,940 KP instances being made available for empirical testing. These KPs are …

The problem is considered of optimizing discrete parameters in the presence of constraints.
We use the stochastic sigmoid with temperature and put forward the new adaptive gradient …

A method commonly employed to solve integer programming problems is the Branch and
Bound. In this article, maximizing the number of matches held on the first day of pencak silat …

In a computational complexity theory, P, NP, NP-complete and NP-hard problems are
divided into complexity classes which are used to emphasize how challenging it is to solve …

Many years of research on the 0-1 knapsack problem has resulted in highly efficient
algorithms that are capable of quickly solving numerous large problem instances to …