Graph Convolutional Branch and Bound v1.0.0
A TSP solver that combines a graph convolutional network with a 1-Tree branch-and-bound.
|
Go to the source code of this file.
Namespaces | |
namespace | main |
Functions | |
def | main.compute_prob (net, config, dtypeLong, dtypeFloat) |
def | main.write_adjacency_matrix (graph, y_probs, x_edges_values, nodes_coord, filepath, num_nodes, kmedoids_labels=None) |
def | main.add_dummy_cities (num_nodes, model_size) |
def | main.create_temp_file (num_nodes, str_grap) |
def | main.cluster_nodes (graph, k) |
def | main.fix_instance_size (graph, num_nodes, model_size=100) |
def | main.get_instance (num_nodes) |
def | main.main (filepath, num_nodes, model_size) |
Variables | |
main.category | |
sys | main.filepath = sys.argv[1] |
int | main.num_nodes = int(sys.argv[2]) |
int | main.model_size = int(sys.argv[3]) |