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 | HybridSolver |
Functions | |
def | HybridSolver.adjacency_matrix (orig_graph) |
def | HybridSolver.create_temp_file (num_nodes, str_grap) |
def | HybridSolver.get_nodes (graph) |
def | HybridSolver.get_instance (instance, num_nodes) |
def | HybridSolver.build_c_program (build_directory, num_nodes, hyb_mode) |
def | HybridSolver.hybrid_solver (num_instances, num_nodes, hyb_mode, gen_matrix) |
Variables | |
argparse | HybridSolver.parser = argparse.ArgumentParser() |
HybridSolver.type | |
HybridSolver.str | |
HybridSolver.default | |
HybridSolver.int | |
HybridSolver.action | |
argparse | HybridSolver.opts = parser.parse_args() |
argparse | HybridSolver.gen_matrix = False |