Solving Constraint Integer Programs

branch_relpscost.h File Reference

Detailed Description

reliable pseudo costs branching rule

Tobias Achterberg

The reliable pseudo costs branching rule uses the notion of pseudo costs to measure the expected gain in the dual bound when branching on a particular variable. The pseudo cost information is collected during the branch-and-bound search in the same manner as for the pseudo costs branching rule.

The reliable pseudo costs branching rule, however, uses a limited number of look-ahead LP-iterations at the beginning of the search in order to obtain better pseudo cost estimates and make branching decisions in a sense more "reliable" at an early stage of the search, at the price of a higher computational cost at the beginning of the search.

For a more mathematical description and a comparison between the reliable pseudo costs rule and other branching rules in SCIP, we refer to

Tobias Achterberg
Constraint Integer Programming
PhD Thesis, Technische Universit├Ąt Berlin, 2007

Definition in file branch_relpscost.h.

#include "scip/def.h"
#include "scip/type_result.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"
#include "scip/type_var.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeBranchruleRelpscost (SCIP *scip)
SCIP_RETCODE SCIPexecRelpscostBranching (SCIP *scip, SCIP_VAR **branchcands, SCIP_Real *branchcandssol, SCIP_Real *branchcandsfrac, int nbranchcands, SCIP_Bool executebranching, SCIP_RESULT *result)