Recherche - Université de Picardie Jules Verne Accéder directement au contenu

Filtrer vos résultats

3 Résultats
Structure : Identifiant HAL de la structure : 545948

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems

Yanli Liu , Chu-Min Li , Hua Jiang , Kun He
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, Feb 2020, New-York, United States. pp.2392-2399
Communication dans un congrès hal-03636418v1

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem

Hua Jiang , Chu-Min Li , Yanli Liu , Felip Manya
THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, Feb 2018, New-Orleans, United States. pp.1338-1346
Communication dans un congrès hal-03636425v1

A new upper bound for the maximum weight clique problem

Chu-Min Li , Yanli Liu , Hua Jiang , Felip Manya , Yu Li
European Journal of Operational Research, 2018, 270 (1), pp.66-77. ⟨10.1016/j.ejor.2018.03.020⟩
Article dans une revue hal-03636424v1