This repository contains a set of 1787 feasible instances for the 0-1 Knapsack Problem with Group Fairness. The instances are in folder instances and the generator used to create them is in folder ...

Dynamic programming is a powerful technique for solving optimization problems that can be divided into smaller sub-problems. The main idea of dynamic programming is to avoid recomputing the same ...

The goal of the course is to improve programming and problem-solving skills of the students by facing them with difficult problems and by presenting the techniques that help their reasoning in the ...

Uncertainties are widespread in the optimization of process systems, such as uncertainties in process technologies, prices, and customer demands. In this paper, we review the basic concepts and recent ...

Abstract: With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management.

Our method, DeepNovo, introduces deep learning to de novo peptide sequencing from tandem MS data, the key technology for protein characterization in proteomics research. DeepNovo achieves major ...