Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems

Zhongyuan Zhao, A. Swami, Santiago Segarra
2/12/2026

No official code found. Best implementation: XzrTGMu/twin-nphard (7 stars, MIT, last commit 2024-03-08).

Semantic Scholar

Code Implementations(1)

MIT

Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems

72Shell, PythonMay 25, 20222 years agoMIT
approximation-algorithmscombinatorial-optimizationcombinatoricsconnected-dominating-setdeterministic-policy-gradients+15 more

Similar Papers

Cite this paper

@article{zhao2026graphbased,
  title  = {Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems},
  author = {Zhongyuan Zhao and A. Swami and Santiago Segarra},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:325acb7159234497a0938c019d21ed7bc7f9514f},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/325acb7159234497a0938c019d21ed7bc7f9514f.svg)](https://codeofpaper.com/paper/325acb7159234497a0938c019d21ed7bc7f9514f)

Discussion