Primal Heuristics
Detailed Description
This page contains a list of all primal heuristics which are currently available.
A detailed description what a primal heuristic does and how to add a primal heuristic to GCG can be found here.
Modules | |
Diving Heuristics | |
This page contains a list of all diving heuristics which are currently available. | |
Files | |
file | heur_gcgdins.h |
DINS primal heuristic. | |
file | heur_gcgfeaspump.h |
Objective Feasibility Pump 2.0. | |
file | heur_gcglinesdiving.h |
LP diving heuristic that fixes variables with a large difference to their root solution. | |
file | heur_gcgrens.h |
LNS heuristic that finds the optimal rounding to a given point. | |
file | heur_gcgrins.h |
LNS heuristic that combines the incumbent with the LP optimum. | |
file | heur_gcgrounding.h |
LP gcgrounding heuristic that tries to recover from intermediate infeasibilities. | |
file | heur_gcgshifting.h |
LP gcgrounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables. | |
file | heur_gcgsimplerounding.h |
simple and fast LP rounding heuristic | |
file | heur_gcgzirounding.h |
zirounding primal heuristic | |
file | heur_greedycolsel.h |
greedy column selection primal heuristic | |
file | heur_relaxcolsel.h |
relaxation based column selection primal heuristic | |
file | heur_restmaster.h |
Restricted Master Heuristic. | |
file | heur_setcover.h |
set covering primal heuristic according to Caprara, Fischetti, and Toth (1999) | |
file | heur_xpcrossover.h |
Extreme Point Crossover. | |
file | heur_xprins.h |
Extreme Point RINS. | |