Filtrer vos résultats
- 9
- 5
- 4
- 9
- 1
- 1
- 1
- 3
- 2
- 1
- 9
- 9
- 9
- 6
- 3
- 1
- 1
- 9
- 8
- 6
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
triés par
|
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problemComputers and Operations Research, 2017, 84, pp.1-15. ⟨10.1016/j.cor.2017.02.017⟩
Article dans une revue
hal-03636427v1
|
|||
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique ProblemTHIRTY-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 Learning Based Branch and Bound for Maximum Common Subgraph Related ProblemsTHIRTY-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-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling ProblemTHIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, Feb 2019, Honolulu, United States. pp.2262-2271
Communication dans un congrès
hal-03636421v1
|
|||
Incremental Upper Bound for the Maximum Clique ProblemINFORMS Journal on Computing, 2018, 30 (1), pp.137-153. ⟨10.1287/ijoc.2017.0770⟩
Article dans une revue
hal-03636423v1
|
|||
Solving longest common subsequence problems via a transformation to the maximum clique problemComputers and Operations Research, 2021, 125, ⟨10.1016/j.cor.2020.105089⟩
Article dans une revue
hal-03636411v1
|
|||
A new upper bound for the maximum weight clique problemEuropean Journal of Operational Research, 2018, 270 (1), pp.66-77. ⟨10.1016/j.ejor.2018.03.020⟩
Article dans une revue
hal-03636424v1
|
|||
An Exact Algorithm for the Maximum Weight Clique Problem in Large GraphsTHIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, Feb 2017, San Francisco, United States. pp.830-838
Communication dans un congrès
hal-03636428v1
|
|||
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large GraphsECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, Aug 2016, The Hague, Netherlands. pp.939-947, ⟨10.3233/978-1-61499-672-9-939⟩
Communication dans un congrès
hal-03636430v1
|