The paper discusses an enhancement to a recently presented supervised learning algorithm to solve the Maximum Independent Set problem. In particular, it is shown that the algorithm can be improved by simplifying the task learnt by the neural network adopted, with measurable effects on the quality of the solutions provided on unseen instances. Empirical results are presented to validate the idea.

Montemanni, R., Smith, D., Chou, X. (2023). Maximum Independent Sets and Supervised Learning. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 11(4), 957-972 [10.1007/s40305-022-00395-8].

Maximum Independent Sets and Supervised Learning

Chou, X
2023

Abstract

The paper discusses an enhancement to a recently presented supervised learning algorithm to solve the Maximum Independent Set problem. In particular, it is shown that the algorithm can be improved by simplifying the task learnt by the neural network adopted, with measurable effects on the quality of the solutions provided on unseen instances. Empirical results are presented to validate the idea.
Articolo in rivista - Articolo scientifico
Graph theory; Machine learning; Maximum Clique problem; Maximum Independent Set problem
English
2023
11
4
957
972
none
Montemanni, R., Smith, D., Chou, X. (2023). Maximum Independent Sets and Supervised Learning. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 11(4), 957-972 [10.1007/s40305-022-00395-8].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/467038
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
Social impact