branch_and_bound.h

Go to the documentation of this file.

 
#ifndef BRANCHANDBOUND1TREE_BRANCH_AND_BOUND_H
#define BRANCHANDBOUND1TREE_BRANCH_AND_BOUND_H
#include "kruskal.h"
#include "prim.h"
#include "../data_structures/b_and_b_data.h"
 
 
static Problem * problem;
 
 
 
void dfs(SubProblem *subProblem);
 
 
 
bool check_hamiltonian(SubProblem *subProblem);
 
 
 
BBNodeType mst_to_one_tree(SubProblem *currentSubproblem, Graph *graph);
 
 
 
void clean_matrix(SubProblem *subProblem);
 
 
 
void copy_constraints(SubProblem *subProblem, const SubProblem *otherSubProblem);
 
 
 
bool compare_subproblems(const SubProblem *a, const SubProblem *b);
 
 
 
void branch(SubProblemsList *openSubProblems, SubProblem *subProblem);
 
 
 
int variable_fixing (SubProblem * subProblem);
 
 
 
bool infer_constraints(SubProblem * subProblem);
 
 
 
void bound(SubProblem *currentSubProb);
 
 
 
bool time_limit_reached(void);
 
 
 
void nearest_prob_neighbour(unsigned short start_node);
 
 
 
unsigned short find_candidate_node(void);
 
 
 
void branch_and_bound(Problem * current_problem);
 
 
 
bool check_feasibility(Graph * graph);
 
 
 
void set_problem(Problem * current_problem);
 
 
 
void print_subProblem(const SubProblem *subProblem);
 
 
 
void print_problem(void);
 
 
#endif //BRANCHANDBOUND1TREE_BRANCH_AND_BOUND_H