# SCIP

Solving Constraint Integer Programs

## Detailed Description

The (multi-level) lookahead branching rule applies strong branching to every fractional value of the LP solution at the current node of the branch-and-bound tree, as well as recursivly to every temporary child problem created by this strong branching. The rule selects the candidate with the best proven dual bound.

The branching rule was motivated by the following technical report:

Wasu Glankwamdee and Jeff Linderoth
Lookahead Branching for Mixed Integer Programming
Technical Report 06T-004, Department of Industrial and Systems Engineering, Lehigh University.

For a more mathematical description and a comparison between lookahead branching and other branching rules in SCIP, we refer to

Christoph Schubert
Master Thesis, Technische Universität Berlin, 2017

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

Go to the source code of this file.