6 #ifndef CMR_PRICE_UTIL_H 7 #define CMR_PRICE_UTIL_H 28 constexpr
double MaxPenalty = 0.10;
30 constexpr
double RecoverMaxPen = 0.00000001;
41 inline std::ostream &operator<<(std::ostream &os,
ScanStat stat)
46 out =
"searched Partial";
49 out =
"optimal for Partial";
52 out =
"searched Full";
55 out =
"optimal for Full";
64 template <
typename numtype>
68 PrEdge(
int end0,
int end1) :
EndPts(end0, end1), redcost(1.0) {}
70 PrEdge(
int end0,
int end1, numtype rc) :
EndPts(end0, end1), redcost(rc) {}
72 bool operator<(
const PrEdge &rhs)
const {
return redcost < rhs.redcost; }
Scanned some edges, found some with negative reduced cost.
constexpr int f64Batch
Max number to generate during exact lb.
Definition: price_util.hpp:26
Definition: price_util.hpp:65
Utility functions, macros, and structures.
constexpr int AddBatch
Number added to CoreLP at a time.
Definition: price_util.hpp:21
ScanStat
Return type for edge pricing routines.
Definition: price_util.hpp:33
Scanned some edges, found none with negative reduced cost.
The namespace for this project.
Definition: abc_nodesel.hpp:20
constexpr int PoolSize
Number of negative rc edges to keep in pool.
Definition: price_util.hpp:22
Simple base class for storing edge of a graph as a sorted pair of nodes.
Definition: util.hpp:239
constexpr int ScaleBatch
Scale factor for EstBatch.
Definition: price_util.hpp:24
constexpr int Nearest
Number of nearest edges to each node examined.
Definition: price_util.hpp:19
constexpr int EstBatch
Max number of edges to estimate red cost.
Definition: price_util.hpp:23
Scanned all edges, found some with negative reduced cost.
Scanned all edges, none had negative reduced cost.