Solving Constraint Integer Programs

branch_lookahead.h File Reference

Detailed Description

lookahead LP branching rule

Christoph Schubert
Gerald Gamrath

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
Multi-Level Lookahead Branching
Master Thesis, Technische Universit├Ąt Berlin, 2017

Definition in file branch_lookahead.h.

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

Go to the source code of this file.


SCIP_RETCODE SCIPincludeBranchruleLookahead (SCIP *scip)

Function Documentation

◆ SCIPincludeBranchruleLookahead()

SCIP_RETCODE SCIPincludeBranchruleLookahead ( SCIP scip)

creates the lookahead branching rule and includes it in SCIP

scipSCIP data structure

Definition at line 5266 of file branch_lookahead.c.

Referenced by SCIPincludeDefaultPlugins().