ILSGVCP: An improved local search algorithm for generalized vertex cover problem
R Tai, D Ouyang, R Li, L Zhang - Journal of the Operational …, 2023 - Taylor & Francis
The generalized vertex cover problem (GVCP) is a well-known combinatorial problem of the
classic minimum vertex cover problem with rich applications. And local search algorithm is …
classic minimum vertex cover problem with rich applications. And local search algorithm is …
Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
The satisfiability problem (SAT) is a critically important issue in multiple branches of
computer science and artificial intelligence, with its relevance in industrial applications being …
computer science and artificial intelligence, with its relevance in industrial applications being …
A decision support system based on an artificial multiple intelligence system for vegetable crop land allocation problem
This research focuses on the development of a novel artificial multiple intelligence system
(AMIS), which is more flexible and effective than existing techniques for determining …
(AMIS), which is more flexible and effective than existing techniques for determining …