Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
This is a tensorflow implementation of solving the maximum indepedent set problem using graph convolutional networks and guided tree search. The graph convolutional networks implementation is based on GCN (MIT License).
Required python libraries: Tensorflow (>=1.3) + Scipy + Numpy.
Tested in Ubuntu 16.04 LTS + Intel i7 CPU + Nvidia Titan X (Pascal) with Cuda (>=8.0) and CuDNN (>=6.0). CPU mode should also work with no/minor changes.
Quick Start (Testing)
- Note the result produced here is without graph reduction and local search. If you wish to use them, please see the instructions in the next subsection.
- Clone this repository.
- Run "python demo.py" or "python demo_parallel.py" to solve the problem instance(s) in the "data" folder.
- The result will be saved in "res_600".
Instructions for using graph reduction and local search
- Clone KaMIS (GPLv2 License) from its Project or GitHub page.
- Copy the files in "kernel" of this repo to "KaMIS" and run make. This will generate a shared object file "libreduce.so".
- Copy "libreduce.so" back to "kernel".
- Uncomment lines 8, 20, 87, 109, 272, 300 and comment 88, 110, 273 in "demo_parallel.py" to enhance it with graph reduction and local search. "demo.py" can be modified accordingly to include these components.
- Rerun "demo_parallel.py" to see the difference.
If you use our code for research, please cite our paper:
Zhuwen Li, Qifeng Chen and Vladlen Koltun. Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search. In NIPS 2018.
- Add the training code
- Implement graph reduction and local search, and release them under MIT License
If you have any question or request about the code and data, please email me at email@example.com.