We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for all binary constraint satisfaction problems. Training is unsupervised, and it is sufficient to train on relatively small instances; the resulting networks perform well on much larger instances (at least 10-times larger). We experimentally evaluate our approach for a variety of problems, including Maximum Cut and Maximum Independent Set. Despite being generic, we show that our approach matches or surpasses most greedy and semi-definite programming based algorithms and sometimes even outperforms state-of-the-art heuristics for the specific problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1909.08387")
get_code_for_paper("1909.08387")
have("1909.08387")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1909.08387.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1909.08387)
Connect an agent — have() is free.