#include <boxfind.h>
Collaboration diagram for IntervalReduction:
Public Types | |
LOWER | |
UPPER | |
WHATEVER | |
enum | which_bound_type { LOWER, UPPER, WHATEVER } |
Public Member Functions | |
IntervalReduction (Pointer< MinlpProblem > prob_=NULL) | |
void | set_problem (Pointer< MinlpProblem > prob_) |
void | compute (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup) |
void | compute (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup, set< pair< int, which_bound_type > > &startset) |
void | print_small_boxes (dvector &low, dvector &up) |
Public Attributes | |
bool | do_print |
bool | empty_boxes |
double | min_impr |
int | maxfunceval |
set< pair< int, int > > | reduced_integer |
dvector | reduction_by_block |
Stores for each block, how much it was reduced. | |
double | reduction |
Private Types | |
typedef Graph< NodeData, EdgeData, true, true > | DependencyGraph |
Private Member Functions | |
void | run (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup, set< pair< const DependencyGraph::NodeType *, which_bound_type > > &nodeset) |
Private Attributes | |
Pointer< MinlpProblem > | prob |
DependencyGraph | dependency_graph |
Friends | |
ostream & | operator<< (ostream &out, const EdgeData &ed) |
Classes | |
class | EdgeData |
class | NodeData |
Definition at line 143 of file boxfind.h.
typedef Graph<NodeData,EdgeData,true,true> IntervalReduction::DependencyGraph [private] |
IntervalReduction::IntervalReduction | ( | Pointer< MinlpProblem > | prob_ = NULL |
) |
void IntervalReduction::run | ( | dvector & | newlow, | |
dvector & | newup, | |||
const dvector & | oldlow, | |||
const dvector & | oldup, | |||
set< pair< const DependencyGraph::NodeType *, which_bound_type > > & | nodeset | |||
) | [private] |
void IntervalReduction::set_problem | ( | Pointer< MinlpProblem > | prob_ | ) |
void IntervalReduction::compute | ( | dvector & | newlow, | |
dvector & | newup, | |||
const dvector & | oldlow, | |||
const dvector & | oldup | |||
) |
void IntervalReduction::compute | ( | dvector & | newlow, | |
dvector & | newup, | |||
const dvector & | oldlow, | |||
const dvector & | oldup, | |||
set< pair< int, which_bound_type > > & | startset | |||
) |
ostream& operator<< | ( | ostream & | out, | |
const EdgeData & | ed | |||
) | [friend] |
Pointer<MinlpProblem> IntervalReduction::prob [private] |
double IntervalReduction::min_impr |
set<pair<int, int> > IntervalReduction::reduced_integer |
double IntervalReduction::reduction |