The struct used to represent the overall problem. More...

#include <b_and_b_data.h>

Public Attributes
Graph	graph
	The Graph of the problem.

Graph	reformulationGraph
	The Graph used to perform the dual reformulation of Edge weights.

unsigned short	candidateNodeId
	The id of the candidate node.

unsigned short	totTreeLevels
	The total number of levels in the Branch and Bound tree.

SubProblem	bestSolution
	The best solution found so far.

double	bestValue
	The cost of the best solution found so far.

unsigned int	generatedBBNodes
	The number of nodes generated in the Branch and Bound tree.

unsigned int	exploredBBNodes
	The number of nodes explored in the Branch and Bound tree.

unsigned int	num_fixed_edges
	The number of fixed edges in the Branch and Bound tree.

bool	interrupted
	True if the algorithm has been interrupted by timeout.

clock_t	start
	The time when the algorithm started.

clock_t	end
	The time when the algorithm ended.

Detailed Description

The struct used to represent the overall problem.

Definition at line 62 of file b_and_b_data.h.

Member Data Documentation

◆ bestSolution

SubProblem Problem::bestSolution

The best solution found so far.

Definition at line 67 of file b_and_b_data.h.

◆ bestValue

double Problem::bestValue

The cost of the best solution found so far.

Definition at line 68 of file b_and_b_data.h.

◆ candidateNodeId

unsigned short Problem::candidateNodeId

The id of the candidate node.

Definition at line 65 of file b_and_b_data.h.

◆ end

clock_t Problem::end

The time when the algorithm ended.

Definition at line 74 of file b_and_b_data.h.

◆ exploredBBNodes

unsigned int Problem::exploredBBNodes

The number of nodes explored in the Branch and Bound tree.

Definition at line 70 of file b_and_b_data.h.

◆ generatedBBNodes

unsigned int Problem::generatedBBNodes

The number of nodes generated in the Branch and Bound tree.

Definition at line 69 of file b_and_b_data.h.

◆ graph

Graph Problem::graph

The Graph of the problem.

Definition at line 63 of file b_and_b_data.h.

◆ interrupted

bool Problem::interrupted

True if the algorithm has been interrupted by timeout.

Definition at line 72 of file b_and_b_data.h.

◆ num_fixed_edges

unsigned int Problem::num_fixed_edges

The number of fixed edges in the Branch and Bound tree.

Definition at line 71 of file b_and_b_data.h.

◆ reformulationGraph

Graph Problem::reformulationGraph

The Graph used to perform the dual reformulation of Edge weights.

Definition at line 64 of file b_and_b_data.h.

◆ start

clock_t Problem::start

The time when the algorithm started.

Definition at line 73 of file b_and_b_data.h.

◆ totTreeLevels

unsigned short Problem::totTreeLevels

The total number of levels in the Branch and Bound tree.

Definition at line 66 of file b_and_b_data.h.

Public Attributes