File List

Here is a list of all files with brief descriptions:

benders_gcg.c | GCG Benders' decomposition algorithm |

benders_gcg.h | GCG Benders' decomposition |

bendersplugins.c | SCIP plugins for the master problem running in Benders' decomposition mode |

bendersplugins.h | SCIP plugins for the master problem running in Benders' decomposition mode |

bipartitegraph.h | |

bipartitegraph_def.h | A bipartite graph |

bliss.cpp | Helper functions for automorphism detection |

bliss_automorph.cpp | Automorphism recognition of SCIPs |

bliss_automorph.h | Automorphism recognition of SCIPs |

branch_empty.c | Branching rule for the original problem while real branching is applied in the master |

branch_empty.h | Branching rule for original problem in GCG while real branching is in the master |

branch_generic.c | Branching rule based on vanderbeck's generic branching scheme |

branch_generic.h | Branching rule based on vanderbeck's generic branching scheme |

branch_orig.c | Branching rule for the original problem in GCG |

branch_orig.h | Branching rule for original problem in GCG |

branch_relpsprob.c | Generalized reliable pseudo costs branching rule |

branch_relpsprob.h | Reliable pseudo costs branching rule |

branch_ryanfoster.c | Branching rule for original problem in GCG implementing the Ryan and Foster branching scheme |

branch_ryanfoster.h | Branching rule for original problem in GCG implementing the Ryan and Foster branching scheme |

bridge.h | Bridge |

class_consclassifier.cpp | Class for classifying constraints |

class_consclassifier.h | Class for classifying constraints |

class_indexclassifier.cpp | Generalization of ConsClassifier and VarClassifier |

class_indexclassifier.h | Generalization of ConsClassifier and VarClassifier |

class_miscvisualization.cpp | Miscellaneous methods for visualizations |

class_miscvisualization.h | Miscellaneous methods for visualizations |

class_pricingcontroller.cpp | Pricing controller managing the pricing strategy |

class_pricingcontroller.h | Pricing controller managing the pricing strategy |

class_pricingtype.cpp | Abstraction for SCIP pricing types |

class_pricingtype.h | Abstraction for SCIP pricing types |

class_seeed.cpp | Class with functions for seeed (aka incomplete decomposition ) |

class_seeed.h | |

class_seeedpool.cpp | Class with functions for seeedpoolnTotalSeeeds |

class_seeedpool.h | Class with functions for seeed pool where a seeed is a (potentially incomplete) description of a decomposition (not to confuse with the band from German capital) |

class_stabilization.cpp | Class with functions for dual variable smoothing |

class_stabilization.h | Class with functions for dual variable smoothing |

class_varclassifier.cpp | Class for classifying variables |

class_varclassifier.h | Class for classifying variables |

colpool.c | Methods for storing cols in a col pool (based on SCIP's cut pool) |

colpool.h | Internal methods for storing cols in a col pool |

columngraph.h | A row graph where each column is a node and columns are adjacent if they appear in a row |

columngraph_def.h | A row graph where each column is a node and columns are adjacent if they appear in one row |

cons_decomp.cpp | |

cons_decomp.h | Constraint handler for structure detection |

cons_integralorig.c | Constraint handler for enforcing integrality of the transferred master solution in the original problem |

cons_integralorig.h | Constraint handler for the integrality constraint |

cons_masterbranch.c | Constraint handler for storing the branching decisions at each node of the tree |

cons_masterbranch.h | Constraint handler for storing the branching decisions at each node of the tree |

cons_origbranch.c | Constraint handler for storing the branching decisions at each node of the tree |

cons_origbranch.h | Constraint handler for storing the branching decisions at each node of the tree |

dec_colors.cpp | Detector assigning color classes to constraints and try combinations of colors in the master |

dec_colors.h | Detector assigning color classes to constraints and try combinations of colors in the master |

dec_compgreedily.cpp | Detector compgreedily (assigns the open cons and open vars of the seeed greedily) |

dec_compgreedily.h | Compgreedily detector |

dec_connected.c | Detector for classical and blockdiagonal problems |

dec_connected.h | Connected compontent detector |

dec_connected_noNewLinkingVars.cpp | |

dec_connected_noNewLinkingVars.h | Connected_noNewLinkingVars detector |

dec_connectedbase.cpp | |

dec_connectedbase.h | Connectedbase detector |

dec_consclass.cpp | Detector consclass (put your description here) |

dec_consclass.h | Consclass detector |

dec_consname.cpp | |

dec_consname.h | Structure detection by constraint names (via regular expressions) |

dec_constype.cpp | Detector constype (put your description here) |

dec_constype.h | Constype detector |

dec_cutpacking.c | Staircase detector via recursive partitioning (uses hmetis) |

dec_cutpacking.h | Staircase detector via recursive partitioning (uses hmetis) |

dec_dbscan.cpp | Detector DBSCAN (put your description here) |

dec_dbscan.h | Detector for diagonal (bordered) structures via DBSCAN clustering algorithm |

dec_densemasterconss.cpp | Detector densemasterconss (put your description here) |

dec_densemasterconss.h | Densemasterconss detector |

dec_generalmastersetcover.cpp | Detector generalmastersetcover (sets setcovering, logior constraint and constraint with infinity rhs and nonnegative lhs to master) |

dec_generalmastersetcover.h | Generalmastersetcover detector |

dec_generalmastersetpack.cpp | Detector generalmastersetpack (sets setcovering and constraint with -infinity lhs and nonnegative rhs to master) |

dec_generalmastersetpack.h | Generalmastersetpack detector |

dec_generalmastersetpart.cpp | Detector generalmastersetpart (sets setcovering and constraint with the same nonnegative rhs and lhs to master) |

dec_generalmastersetpart.h | Generalmastersetpart detector |

dec_hcgpartition.cpp | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_hcgpartition.h | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_hrcgpartition.cpp | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_hrcgpartition.h | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_hrgpartition.cpp | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_hrgpartition.h | Arrowhead and bordered detector via graph partitioning (uses hmetis) |

dec_isomorph.cpp | Detector for pricing problems that can be aggregated (uses bliss) |

dec_isomorph.h | Detector for pricing problems that can be aggregated (uses bliss) |

dec_mastersetcover.cpp | Detector mastersetcover (sets setcovering and logicor constraint to master) |

dec_mastersetcover.h | Mastersetcover detector |

dec_mastersetpack.cpp | Detector mastersetpack (sets setpacking constraints to master) |

dec_mastersetpack.h | Mastersetpack detector |

dec_mastersetpart.cpp | Detector mastersetpart (set setpartitioning constraints to master) |

dec_mastersetpart.h | Mastersetpart detector |

dec_mcl.cpp | Detector MCL |

dec_mcl.h | Detector for diagonal (bordered) structures via MCL clustering algorithm |

dec_mst.cpp | Detector MST |

dec_mst.h | Detector for diagonal (bordered) structures via Minimum Spanning Tree clustering algorithm |

dec_postprocess.cpp | |

dec_postprocess.h | Postprocess detector |

dec_random.c | Random structure detection for testing purposes |

dec_random.h | Random detector |

dec_staircase.c | Detector for staircase matrices |

dec_staircase.h | Staircase compontent detector |

dec_staircase_lsp.cpp | |

dec_staircase_lsp.h | |

dec_stairheur.cpp | Detector for staircase structures via ROC algorithms |

dec_stairheur.h | Detector for staircase structures via ROC algorithms |

dec_varclass.cpp | Detector varclass |

dec_varclass.h | Varclass detector |

decomp.c | Generic methods for working with different decomposition structures |

decomp.h | Private methods for working with decomp structures |

dialog_gcg.c | GCG user interface dialog |

dialog_gcg.h | GCG user interface dialog |

dialog_graph.cpp | A dialog to write graph representations of the matrix and read partitions as decompositions |

dialog_graph.h | A dialog to write graph representations of the matrix and read partitions as decompositions |

dialog_master.c | User interface dialog for master problem |

dialog_master.h | User interface dialog for master problem |

disp_gcg.c | GCG display columns |

disp_gcg.h | GCG display columns |

disp_master.c | Master display columns |

disp_master.h | Master display columns |

event_bestsol.c | Eventhdlr to record the best primal bound for each heuristic |

event_bestsol.h | Eventhdlr to record the best primal bound for each heuristic |

event_display.c | Eventhdlr to disable the master display after the root node |

event_display.h | Eventhdlr to disable the master display after the root node |

event_mastersol.c | Eventhdlr to transfer solutions found in the original problem to the master problem |

event_mastersol.h | Eventhdlr to transfer solutions found in the original problem to the master problem |

event_relaxsol.c | Eventhandler to update the relaxation solution in the original problem when the master LP has been solved |

event_relaxsol.h | Eventhandler to update the relaxation solution in the original problem when the master LP has been solved |

event_solvingstats.c | Eventhdlr for writing various types of information during the solving process |

event_solvingstats.h | Eventhdlr for writing various types of information during the solving process |

gcg.h | GCG interface methods |

gcgcol.c | Methods for working with gcg column structure |

gcgcol.h | Private methods for working with gcg column data structure |

gcggithash.c | Git hash methods |

gcggithash.h | Git hash methods |

gcgheur.c | Public methods for GCG heuristics |

gcgplugins.c | SCIP plugins for generic column generation |

gcgplugins.h | SCIP plugins for generic column generation |

gcgpqueue.c | Methods for working with priority queue |

gcgpqueue.h | Private methods for working with priority queue |

gcgsepa.c | Public methods for GCG separators |

gcgsort.c | Sorting methods, adapted from SCIP's sorttpl.c to include userdata |

gcgsort.h | Sorting functions, adapted from SCIP's sorttpl to include userdata |

gcgsorttpl.c | |

gcgvar.c | GCG variable access functions |

graph.h | Miscellaneous graph methods for structure detection |

graph_def.h | Miscellaneous graph methods for structure detection |

graph_gcg.cpp | |

graph_gcg.h | Implementation of the graph which supports both node and edge weights |

graph_interface.h | Miscellaneous graph interface methods |

graph_tclique.cpp | Interface to the SCIP tclique graph library |

graph_tclique.h | Interface to the SCIP tclique graph library |

graphalgorithms.h | Several metrics for graphs |

graphalgorithms_def.h | Several metrics for graphs |

heur_gcgcoefdiving.c | LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |

heur_gcgcoefdiving.h | LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |

heur_gcgdins.c | DINS primal heuristic (according to Ghosh) |

heur_gcgdins.h | DINS primal heuristic |

heur_gcgfeaspump.c | Objective Feasibility Pump 2.0 |

heur_gcgfeaspump.h | Objective Feasibility Pump 2.0 |

heur_gcgfracdiving.c | LP diving heuristic that chooses fixings w.r.t. the fractionalities |

heur_gcgfracdiving.h | LP diving heuristic that chooses fixings w.r.t. the fractionalities |

heur_gcgguideddiving.c | LP diving heuristic that chooses fixings in direction of incumbent solutions |

heur_gcgguideddiving.h | LP diving heuristic that chooses fixings in direction of incumbent solutions |

heur_gcglinesdiving.c | LP diving heuristic that fixes variables with a large difference to their root solution |

heur_gcglinesdiving.h | LP diving heuristic that fixes variables with a large difference to their root solution |

heur_gcgpscostdiving.c | LP diving heuristic that chooses fixings w.r.t. the pseudo cost values |

heur_gcgpscostdiving.h | LP diving heuristic that chooses fixings w.r.t. the pseudo cost values |

heur_gcgrens.c | LNS heuristic that finds the optimal rounding to a given point |

heur_gcgrens.h | LNS heuristic that finds the optimal rounding to a given point |

heur_gcgrins.c | LNS heuristic that combines the incumbent with the LP optimum |

heur_gcgrins.h | LNS heuristic that combines the incumbent with the LP optimum |

heur_gcgrounding.c | LP gcgrounding heuristic that tries to recover from intermediate infeasibilities |

heur_gcgrounding.h | LP gcgrounding heuristic that tries to recover from intermediate infeasibilities |

heur_gcgshifting.c | LP gcgrounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables |

heur_gcgshifting.h | LP gcgrounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables |

heur_gcgsimplerounding.c | Simple and fast LP rounding heuristic |

heur_gcgsimplerounding.h | Simple and fast LP rounding heuristic |

heur_gcgveclendiving.c | LP diving heuristic that rounds variables with long column vectors |

heur_gcgveclendiving.h | LP diving heuristic that rounds variables with long column vectors |

heur_gcgzirounding.c | Zirounding primal heuristic |

heur_gcgzirounding.h | Zirounding primal heuristic |

heur_greedycolsel.c | Greedy column selection primal heuristic |

heur_greedycolsel.h | Greedy column selection primal heuristic |

heur_mastercoefdiving.c | Master LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |

heur_mastercoefdiving.h | Master LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |

heur_masterdiving.c | Primal heuristic interface for LP diving heuristics on the master variables |

heur_masterdiving.h | Primal heuristic interface for LP diving heuristics on the master variables |

heur_masterfracdiving.c | Master LP diving heuristic that chooses fixings w.r.t. the fractionalities |

heur_masterfracdiving.h | Master LP diving heuristic that chooses fixings w.r.t. the fractionalities |

heur_masterlinesdiving.c | LP diving heuristic that fixes variables with a large difference to their root solution |

heur_masterlinesdiving.h | Master LP diving heuristic that fixes variables with a large difference to their root solution |

heur_mastervecldiving.c | Master LP diving heuristic that rounds variables with long column vectors |

heur_mastervecldiving.h | Master LP diving heuristic that rounds variables with long column vectors |

heur_origdiving.c | Primal heuristic interface for LP diving heuristics on the original variables |

heur_origdiving.h | Primal heuristic interface for LP diving heuristics on the original variables |

heur_relaxcolsel.c | Relaxation based column selection primal heuristic |

heur_relaxcolsel.h | Relaxation based column selection primal heuristic |

heur_restmaster.c | Restricted Master Heuristic |

heur_restmaster.h | Restricted Master Heuristic |

heur_setcover.c | Set covering primal heuristic according to Caprara, Fischetti, and Toth (1999) |

heur_setcover.h | Set covering primal heuristic according to Caprara, Fischetti, and Toth (1999) |

heur_xpcrossover.c | Extreme Point Crossover |

heur_xpcrossover.h | Extreme Point Crossover |

heur_xprins.c | Extreme Point RINS |

heur_xprins.h | Extreme Point RINS |

hypercolgraph.h | Column hypergraph |

hypercolgraph_def.h | Column hypergraph |

hypergraph.h | Miscellaneous hypergraph methods for structure detection |

hypergraph_def.h | Miscellaneous hypergraph methods for structure detection |

hyperrowcolgraph.h | A hypergraph with row and column nodes |

hyperrowcolgraph_def.h | A hypergraph with row and column nodes |

hyperrowgraph.h | Column hypergraph |

hyperrowgraph_def.h | Column hypergraph |

inst.cpp | Explicit instanciations for templates |

main.c | Main file for C compilation |

masterplugins.c | SCIP plugins for generic column generation |

masterplugins.h | SCIP plugins for generic column generation |

matrixgraph.h | Miscellaneous matrixgraph methods for structure detection |

matrixgraph_def.h | Miscellaneous matrixgraph methods for structure detection |

misc.c | Miscellaneous methods |

nodesel_master.c | Node selector for coordination of master and original formulation |

nodesel_master.h | Node selector for coordination of master and original formulation |

objdialog.cpp | C++ wrapper for dialogs |

objdialog.h | C++ wrapper for dialogs |

objpricer_gcg.h | GCG variable pricer |

params_visu.c | Parameter-related stuff for visualization |

params_visu.h | |

presol_roundbound.c | Roundbound presolver: round fractional bounds on integer variables |

presol_roundbound.h | Roundbound presolver: round fractional bounds on integer variables |

pricer_gcg.cpp | Pricer for generic column generation |

pricer_gcg.h | GCG variable pricer |

pricestore_gcg.c | |

pricestore_gcg.h | |

pricingjob.c | Methods for working with pricing jobs |

pricingjob.h | Private methods for working with pricing jobs, to be used by the pricing controller only |

pricingprob.c | Methods for working with pricing problems |

pricingprob.h | Private methods for working with pricing problems, to be used by the pricing controller only |

priority_graph.h | |

pub_bliss.h | Helper functions for automorphism detection |

pub_colpool.h | Public methods for storing cols in a col pool |

pub_decomp.h | Public methods for working with decomposition structures |

pub_gcgcol.h | Public methods for working with gcg columns |

pub_gcgheur.h | Public methods for GCG heuristics |

pub_gcgpqueue.h | |

pub_gcgsepa.h | Public methods for GCG separators |

pub_gcgvar.h | Public methods for GCG variables |

pub_pricingjob.h | Public methods for working with pricing jobs |

pub_pricingprob.h | Public methods for working with pricing problems |

pub_solver.h | |

reader_blk.cpp | |

reader_blk.h | BLK file reader for structure information |

reader_cls.cpp | CLS reader for writing files containing classifier data |

reader_cls.h | CLS reader for writing files containing classifier data |

reader_dec.cpp | |

reader_dec.h | DEC file reader for structure information |

reader_gp.cpp | GP file reader writing seeeds to gnuplot files |

reader_gp.h | GP file reader writing gnuplot files |

reader_ref.c | REF file reader for structure information |

reader_ref.h | REF file reader for structure information |

reader_tex.cpp | Tex file reader for writing seeeds to LaTeX files |

reader_tex.h | Tex file reader for writing decomposition details to LaTeX files |

relax_gcg.c | GCG relaxator |

relax_gcg.h | GCG relaxator |

rowgraph.h | A row graph where each row is a node and rows are adjacent if they share a variable |

rowgraph_def.h | A row graph where each row is a node and rows are adjacent if they share a variable |

rowgraph_weighted.h | A row graph where each row is a node and rows are adjacent if they share a variable. The edges are weighted according to specified similarity measure |

rowgraph_weighted_def.h | A row graph where each row is a node and rows are adjacent if they share a variable. The edges are weighted according to specified similarity measure |

scip_misc.c | Various SCIP helper methods |

scip_misc.h | Various SCIP helper methods |

sepa_basis.c | Basis separator |

sepa_basis.h | Basis separator |

sepa_master.c | Master separator |

sepa_master.h | Master separator |

solver.c | Methods for GCG pricing solvers |

solver.h | Public methods for GCG pricing solvers |

solver_cliquer.c | Heuristic solver for pricing problems that solves independent set problems with cliquer |

solver_cliquer.h | Heuristic solver for pricing problems that solves independent set problems with cliquer |

solver_cplex.c | Cplex solver for pricing problems |

solver_cplex.h | Cplex solver for pricing problems |

solver_knapsack.c | Knapsack solver for pricing problems |

solver_knapsack.h | Knapsack solver for pricing problems |

solver_mip.c | Pricing solver solving the pricing problem as a sub-MIP, using SCIP |

solver_mip.h | Mip solver for pricing problems |

stat.c | Some printing methods for statistics |

stat.h | Prints information about the best decomposition |

type_branchgcg.h | Type definitions for branching rules in GCG projects |

type_colpool.h | Type definitions for storing cols in a col pool |

type_decomp.h | Type definitions for decomposition information in GCG projects |

type_detector.h | Type definitions for detectors in GCG projects |

type_gcgcol.h | Type definitions for gcg column data structure |

type_gcgpqueue.h | Type definitions for priority queue |

type_masterdiving.h | Type definitions for GCG diving heuristics on the master variables |

type_origdiving.h | Type definitions for GCG diving heuristics on the original variables |

type_pricestore_gcg.h | |

type_pricingjob.h | Type definitions for pricing job data structure |

type_pricingprob.h | Type definitions for pricing problem data structure |

type_pricingstatus.h | Type definitions for pricing status |

type_solver.h | Type definitions for pricing problem solvers in GCG project |

weights.cpp | Weight class for graphs |

weights.h | Weight class for graphs |

wrapper_seeed.h | Provides wrapping to have Seeeds and Seeedpools as parameters in C-conform function headers with C++ implementations |

xternal.c | Main document page |