Detailed Description
Prize-collecting/maximum-weight connected subgraph data
Definition at line 155 of file heur_local.c.
Data Fields | |
SCIP_Real *const | prize_biased |
SCIP_Real *const | edgecost_biased |
SCIP_Real *const | edgecost_org |
STP_Bool *const | prizemark |
int *const | prizemarklist |
int | nprizemarks |
SCIP_Bool | isActive |
int | solroot |
Field Documentation
◆ prize_biased
SCIP_Real* const pcmw_data::prize_biased |
prize
Definition at line 157 of file heur_local.c.
Referenced by localKeyVertexHeuristics(), and pcmwGetNewEdgePrize().
◆ edgecost_biased
SCIP_Real* const pcmw_data::edgecost_biased |
fully biased edge costs (PC only)
Definition at line 158 of file heur_local.c.
Referenced by getEdgeCosts(), and localKeyVertexHeuristics().
◆ edgecost_org
SCIP_Real* const pcmw_data::edgecost_org |
original, fully unbiased, edge costs (PC only)
Definition at line 159 of file heur_local.c.
Referenced by getEdgeCostUnbiased(), and localKeyVertexHeuristics().
◆ prizemark
STP_Bool* const pcmw_data::prizemark |
marked?
Definition at line 160 of file heur_local.c.
Referenced by pcmwDataClean(), pcmwDataIsClean(), and pcmwGetNewEdgePrize().
◆ prizemarklist
int* const pcmw_data::prizemarklist |
list of all marked
Definition at line 161 of file heur_local.c.
Referenced by pcmwDataClean(), and pcmwGetNewEdgePrize().
◆ nprizemarks
int pcmw_data::nprizemarks |
size of list
Definition at line 162 of file heur_local.c.
Referenced by pcmwDataClean(), pcmwDataIsClean(), and pcmwGetNewEdgePrize().
◆ isActive
SCIP_Bool pcmw_data::isActive |
actively used (i.e. Pc/Mw graph)?
Definition at line 163 of file heur_local.c.
Referenced by getBoundaryPathCost(), getBoundaryPathCostPrized(), getEdgeCosts(), getEdgeCostUnbiased(), getKeyPathsStar(), getKeyPathUpper(), localKeyVertexHeuristics(), pcmwDataClean(), pcmwDataIsClean(), pcmwGetNewEdgePrize(), and supergraphComputeMst().
◆ solroot
int pcmw_data::solroot |
root of Steiner tree solution
Definition at line 164 of file heur_local.c.
Referenced by pcmwUpdate().