Lense: Learning to navigate subgraph embeddings for large-scale combinatorial optimisation

D Ireland, G Montana - International conference on machine …, 2022 - proceedings.mlr.press
Combinatorial Optimisation problems arise in several application domains and are often
formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are …
被引用次数：10 相关文章

LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation

D Ireland, G Montana - arXiv preprint arXiv:2205.10106, 2022 - arxiv.org
Combinatorial Optimisation problems arise in several application domains and are often
formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are …

LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation

D Ireland, G Montana - arXiv e-prints, 2022 - ui.adsabs.harvard.edu
Combinatorial Optimisation problems arise in several application domains and are often
formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are …