The discounted {0-1} knapsack problem (D{0-1}KP) is a multi-constrained optimization and an extended form of the 0-1 problem. DKP composed set item batches where each batch has three items objective to maximize profit by selecting at most one from batch. Therefore, D{0-1}KP complex found many applications in real economic problems other areas concept promotional discounts exists. As belongs bin...

Antibody-Drug Conjugates (ADCs) and Small Molecule-Drug (SMDCs) represent successful examples of targeted drug-delivery technologies for overcoming unwanted side effects conventional chemotherapy in cancer treatment. In both strategies, a cytotoxic payload is connected to the tumor homing moiety through linker that releases drug inside or proximity cell, represents key component final therapeut...

Nowadays, the techniques available for chronic Chagas' disease diagnosis are very sensitive; however, they do not allow discrimination of the patient's clinical stages of the disease. The present paper describes that three out of the five different repeats contained in the Trypanosoma cruzi TcCA-2 membrane protein (3972-FGQAAAGDKPPP, 6303-FGQAAAGDKPAP, and 3973-FGQAAAGDKPSL) are recognized with...

Many realworld optimization problems are dynamic optimization problems (DOPs), where changes may occur over time regarding the objective function, decision variable, and constraints, etc. DOPs raise big challenges to traditional optimization methods as well as evolutionary algorithms (EAs). The last decade has witnessed increasing research efforts on handling dynamic optimization problems using...