0–1 Integer Linear Programming Model for Weighted Drug Enzyme-Target Identification Problem

conference paper
Published by AIP Publishing in COMPUTATIONAL METHODS IN SCIENCE AND ENGINEERING: Advances in Computational Science: Lectures presented at the International Conference on Computational Methods in Sciences and Engineering 2008 (ICCMSE 2008)

p. 832-835
https://doi.org/10.1063/1.3225445

Abstract

In this paper, a 0–1 integer linear programming model is proposed to solve the weighted drug enzyme‐target identification problem and the experimental results suggest that for the drug enzyme‐target identification problem the weighted case is more reasonable than the un‐weighted case.

Keywords

EXPERIMENTAL
LINEAR PROGRAMMING MODEL
INTEGER
SOLVE
DRUG ENZYME
WEIGHTED DRUG