Detailed Description
abstraction for SCIP pricing types
Definition in file class_pricingtype.cpp.
#include "scip/scip.h"#include "class_pricingtype.h"#include "scip/cons_linear.h"#include "pub_gcgvar.h"#include "scip/pub_lp.h"#include "scip/clock.h"#include "scip_misc.h"#include <exception>Go to the source code of this file.
Macros | |
| #define | DEFAULT_MAXROUNDSREDCOST INT_MAX |
| #define | DEFAULT_MAXCOLSROUNDREDCOSTROOT 100 |
| #define | DEFAULT_MAXCOLSROUNDREDCOST 100 |
| #define | DEFAULT_MAXCOLSPROBREDCOSTROOT 10 |
| #define | DEFAULT_MAXCOLSPROBREDCOST 10 |
| #define | DEFAULT_MAXSUCCESSFULPROBSREDCOST INT_MAX |
| #define | DEFAULT_RELMAXPROBSREDCOSTROOT 1.0 |
| #define | DEFAULT_RELMAXPROBSREDCOST 1.0 |
| #define | DEFAULT_RELMAXSUCCESSFULPROBSREDCOST 1.0 |
| #define | DEFAULT_MAXCOLSROUNDFARKAS 10 |
| #define | DEFAULT_MAXCOLSPROBFARKAS 10 |
| #define | DEFAULT_RELMAXPROBSFARKAS 1.0 |
| #define | SCIP_CALL_EXC(x) |
Macro Definition Documentation
◆ DEFAULT_MAXROUNDSREDCOST
| #define DEFAULT_MAXROUNDSREDCOST INT_MAX |
maximal number of reduced cost pricing rounds
Definition at line 46 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSROUNDREDCOSTROOT
| #define DEFAULT_MAXCOLSROUNDREDCOSTROOT 100 |
maximal number of columns per reduced cost pricing round at root node
Definition at line 47 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSROUNDREDCOST
| #define DEFAULT_MAXCOLSROUNDREDCOST 100 |
maximal number of columns per reduced cost pricing round
Definition at line 48 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSPROBREDCOSTROOT
| #define DEFAULT_MAXCOLSPROBREDCOSTROOT 10 |
maximal number of columns per problem to be generated during red. cost pricing at root node
Definition at line 49 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSPROBREDCOST
| #define DEFAULT_MAXCOLSPROBREDCOST 10 |
maximal number of columns per problem to be generated during red. cost pricing
Definition at line 50 of file class_pricingtype.cpp.
◆ DEFAULT_MAXSUCCESSFULPROBSREDCOST
| #define DEFAULT_MAXSUCCESSFULPROBSREDCOST INT_MAX |
maximal number of successfully solved red. cost pricing problems until pricing loop is aborted
Definition at line 51 of file class_pricingtype.cpp.
◆ DEFAULT_RELMAXPROBSREDCOSTROOT
| #define DEFAULT_RELMAXPROBSREDCOSTROOT 1.0 |
maximal percentage of red. cost pricing problems that are solved at root node if variables have already been found
Definition at line 52 of file class_pricingtype.cpp.
◆ DEFAULT_RELMAXPROBSREDCOST
| #define DEFAULT_RELMAXPROBSREDCOST 1.0 |
maximal percentage of red. cost pricing problems that are solved if variables have already been found
Definition at line 53 of file class_pricingtype.cpp.
◆ DEFAULT_RELMAXSUCCESSFULPROBSREDCOST
| #define DEFAULT_RELMAXSUCCESSFULPROBSREDCOST 1.0 |
maximal percentage of successfully solved red. cost pricing problems until pricing loop is aborted
Definition at line 54 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSROUNDFARKAS
| #define DEFAULT_MAXCOLSROUNDFARKAS 10 |
maximal number of columns per Farkas pricing round
Definition at line 56 of file class_pricingtype.cpp.
◆ DEFAULT_MAXCOLSPROBFARKAS
| #define DEFAULT_MAXCOLSPROBFARKAS 10 |
maximal number of columns per problem to be generated during Farkas pricing
Definition at line 57 of file class_pricingtype.cpp.
◆ DEFAULT_RELMAXPROBSFARKAS
| #define DEFAULT_RELMAXPROBSFARKAS 1.0 |
maximal percentage of Farkas pricing problems that are solved if variables have already been found
Definition at line 58 of file class_pricingtype.cpp.
◆ SCIP_CALL_EXC
| #define SCIP_CALL_EXC | ( | x | ) |
Definition at line 61 of file class_pricingtype.cpp.
