File List
Here is a list of all files with brief descriptions:
o*bipartitegraph.h
o*bipartitegraph_def.hA bipartite graph
o*bliss.cppHelper functions for automorphism detection
o*bliss_automorph.cppAutomorphism recognition of SCIPs
o*bliss_automorph.hAutomorphism recognition of SCIPs
o*branch_empty.cBranching rule for the original problem while real branching is applied in the master
o*branch_empty.hBranching rule for original problem in GCG while real branching is in the master
o*branch_generic.cBranching rule based on vanderbeck's generic branching scheme
o*branch_generic.hBranching rule based on vanderbeck's generic branching scheme
o*branch_orig.cBranching rule for the original problem in GCG
o*branch_orig.hBranching rule for original problem in GCG
o*branch_relpsprob.cGeneralized reliable pseudo costs branching rule
o*branch_relpsprob.hReliable pseudo costs branching rule
o*branch_ryanfoster.cBranching rule for original problem in GCG implementing the Ryan and Foster branching scheme
o*branch_ryanfoster.hBranching rule for original problem in GCG implementing the Ryan and Foster branching scheme
o*bridge.hBridge
o*class_colpool.cppClass with functions for colpool
o*class_colpool.hClass with functions for column pool
o*class_pricingtype.cppAbstraction for SCIP pricing types
o*class_pricingtype.hAbstraction for SCIP pricing types
o*class_stabilization.cppClass with functions for dual variable smoothing
o*class_stabilization.hClass with functions for dual variable smoothing
o*columngraph.hA row graph where each column is a node and columns are adjacent if they appear in a row
o*columngraph_def.hA row graph where each column is a node and columns are adjacent if they appear in one row
o*cons_decomp.cConstraint handler for structure detection
o*cons_decomp.hConstraint handler for structure detection
o*cons_integralorig.cConstraint handler for enforcing integrality of the transferred master solution in the original problem
o*cons_integralorig.hConstraint handler for the integrality constraint
o*cons_masterbranch.cConstraint handler for storing the branching decisions at each node of the tree
o*cons_masterbranch.hConstraint handler for storing the branching decisions at each node of the tree
o*cons_origbranch.cConstraint handler for storing the branching decisions at each node of the tree
o*cons_origbranch.hConstraint handler for storing the branching decisions at each node of the tree
o*dec_arrowheur.cppArrowhead and bordered detector via graph partitioning (uses hmetis)
o*dec_arrowheur.hArrowhead and bordered detector via graph partitioning (uses hmetis)
o*dec_colors.cppDetector assigning color classes to constraints and try combinations of colors in the master
o*dec_colors.hDetector assigning color classes to constraints and try combinations of colors in the master
o*dec_connected.cDetector for classical and blockdiagonal problems
o*dec_connected.hConnected compontent detector
o*dec_cutpacking.cStaircase detector via recursive partitioning (uses hmetis)
o*dec_cutpacking.hStaircase detector via recursive partitioning (uses hmetis)
o*dec_isomorph.cppDetector for pricing problems that can be aggregated (uses bliss)
o*dec_isomorph.hDetector for pricing problems that can be aggregated (uses bliss)
o*dec_random.cRandom structure detection for testing purposes
o*dec_random.hRandom detector
o*dec_staircase.cDetector for staircase matrices
o*dec_staircase.hStaircase compontent detector
o*dec_stairheur.cppDetector for staircase structures via ROC algorithms
o*dec_stairheur.hDetector for staircase structures via ROC algorithms
o*decomp.cGeneric methods for working with different decomposition structures
o*decomp.hPrivate methods for working with decomp structures
o*dialog_gcg.cGCG user interface dialog
o*dialog_gcg.hGCG user interface dialog
o*dialog_graph.cppA dialog to write graph representations of the matrix and read partitions as decompositions
o*dialog_graph.hA dialog to write graph representations of the matrix and read partitions as decompositions
o*dialog_master.cUser interface dialog for master problem
o*dialog_master.hUser interface dialog for master problem
o*disp_gcg.cGCG display columns
o*disp_gcg.hGCG display columns
o*disp_master.cMaster display columns
o*disp_master.hMaster display columns
o*event_bestsol.cEventhdlr to record the best primal bound for each heuristic
o*event_bestsol.hEventhdlr to record the best primal bound for each heuristic
o*event_display.cEventhdlr to disable the master display after the root node
o*event_display.hEventhdlr to disable the master display after the root node
o*event_mastersol.cEventhdlr to transfer solutions found in the original problem to the master problem
o*event_mastersol.hEventhdlr to transfer solutions found in the original problem to the master problem
o*event_relaxsol.cEventhandler to update the relaxation solution in the original problem when the master LP has been solved
o*event_relaxsol.hEventhandler to update the relaxation solution in the original problem when the master LP has been solved
o*event_solvingstats.cEventhdlr for writing various types of information during the solving process
o*event_solvingstats.hEventhdlr for writing various types of information during the solving process
o*gcg.hGCG interface methods
o*gcgcol.cMethods for working with gcg column structure
o*gcgcol.hPrivate methods for working with gcg column data structure
o*gcggithash.cGit hash methods
o*gcggithash.hGit hash methods
o*gcgheur.cPublic methods for GCG heuristics
o*gcgplugins.cSCIP plugins for generic column generation
o*gcgplugins.hSCIP plugins for generic column generation
o*gcgpqueue.cMethods for working with priority queue
o*gcgpqueue.hPrivate methods for working with priority queue
o*gcgvar.cGCG variable access functions
o*graph.hMiscellaneous graph methods for structure detection
o*graph_def.hMiscellaneous graph methods for structure detection
o*graph_interface.hMiscellaneous graph interface methods
o*graph_tclique.cppInterface to the SCIP tclique graph library
o*graph_tclique.hInterface to the SCIP tclique graph library
o*graphalgorithms.hSeveral metrics for graphs
o*graphalgorithms_def.hSeveral metrics for graphs
o*heur_gcgcoefdiving.cLP diving heuristic that chooses fixings w.r.t. the matrix coefficients
o*heur_gcgcoefdiving.hLP diving heuristic that chooses fixings w.r.t. the matrix coefficients
o*heur_gcgdins.cDINS primal heuristic (according to Ghosh)
o*heur_gcgdins.hDINS primal heuristic
o*heur_gcgfeaspump.cObjective Feasibility Pump 2.0
o*heur_gcgfeaspump.hObjective Feasibility Pump 2.0
o*heur_gcgfracdiving.cLP diving heuristic that chooses fixings w.r.t. the fractionalities
o*heur_gcgfracdiving.hLP diving heuristic that chooses fixings w.r.t. the fractionalities
o*heur_gcgguideddiving.cLP diving heuristic that chooses fixings in direction of incumbent solutions
o*heur_gcgguideddiving.hLP diving heuristic that chooses fixings in direction of incumbent solutions
o*heur_gcglinesdiving.cLP diving heuristic that fixes variables with a large difference to their root solution
o*heur_gcglinesdiving.hLP diving heuristic that fixes variables with a large difference to their root solution
o*heur_gcgpscostdiving.cLP diving heuristic that chooses fixings w.r.t. the pseudo cost values
o*heur_gcgpscostdiving.hLP diving heuristic that chooses fixings w.r.t. the pseudo cost values
o*heur_gcgrens.cLNS heuristic that finds the optimal rounding to a given point
o*heur_gcgrens.hLNS heuristic that finds the optimal rounding to a given point
o*heur_gcgrins.cLNS heuristic that combines the incumbent with the LP optimum
o*heur_gcgrins.hLNS heuristic that combines the incumbent with the LP optimum
o*heur_gcgrounding.cLP gcgrounding heuristic that tries to recover from intermediate infeasibilities
o*heur_gcgrounding.hLP gcgrounding heuristic that tries to recover from intermediate infeasibilities
o*heur_gcgshifting.cLP gcgrounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
o*heur_gcgshifting.hLP gcgrounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
o*heur_gcgsimplerounding.cSimple and fast LP rounding heuristic
o*heur_gcgsimplerounding.hSimple and fast LP rounding heuristic
o*heur_gcgveclendiving.cLP diving heuristic that rounds variables with long column vectors
o*heur_gcgveclendiving.hLP diving heuristic that rounds variables with long column vectors
o*heur_gcgzirounding.cZirounding primal heuristic
o*heur_gcgzirounding.hZirounding primal heuristic
o*heur_greedycolsel.cGreedy column selection primal heuristic
o*heur_greedycolsel.hGreedy column selection primal heuristic
o*heur_mastercoefdiving.cMaster LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
o*heur_mastercoefdiving.hMaster LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
o*heur_masterdiving.cPrimal heuristic interface for LP diving heuristics on the master variables
o*heur_masterdiving.hPrimal heuristic interface for LP diving heuristics on the master variables
o*heur_masterfracdiving.cMaster LP diving heuristic that chooses fixings w.r.t. the fractionalities
o*heur_masterfracdiving.hMaster LP diving heuristic that chooses fixings w.r.t. the fractionalities
o*heur_masterlinesdiving.cLP diving heuristic that fixes variables with a large difference to their root solution
o*heur_masterlinesdiving.hMaster LP diving heuristic that fixes variables with a large difference to their root solution
o*heur_mastervecldiving.cMaster LP diving heuristic that rounds variables with long column vectors
o*heur_mastervecldiving.hMaster LP diving heuristic that rounds variables with long column vectors
o*heur_origdiving.cPrimal heuristic interface for LP diving heuristics on the original variables
o*heur_origdiving.hPrimal heuristic interface for LP diving heuristics on the original variables
o*heur_relaxcolsel.cRelaxation based column selection primal heuristic
o*heur_relaxcolsel.hRelaxation based column selection primal heuristic
o*heur_restmaster.cRestricted Master Heuristic
o*heur_restmaster.hRestricted Master Heuristic
o*heur_setcover.cSet covering primal heuristic according to Caprara, Fischetti, and Toth (1999)
o*heur_setcover.hSet covering primal heuristic according to Caprara, Fischetti, and Toth (1999)
o*heur_xpcrossover.cExtreme Point Crossover
o*heur_xpcrossover.hExtreme Point Crossover
o*heur_xprins.cExtreme Point RINS
o*heur_xprins.hExtreme Point RINS
o*hypercolgraph.hColumn hypergraph
o*hypercolgraph_def.hColumn hypergraph
o*hypergraph.hMiscellaneous hypergraph methods for structure detection
o*hypergraph_def.hMiscellaneous hypergraph methods for structure detection
o*hyperrowcolgraph.hA hypergraph with row and column nodes
o*hyperrowcolgraph_def.hA hypergraph with row and column nodes
o*hyperrowgraph.hColumn hypergraph
o*hyperrowgraph_def.hColumn hypergraph
o*inst.cppExplicit instanciations for templates
o*main.cMain file for C compilation
o*masterplugins.cSCIP plugins for generic column generation
o*masterplugins.hSCIP plugins for generic column generation
o*matrixgraph.hMiscellaneous matrixgraph methods for structure detection
o*matrixgraph_def.hMiscellaneous matrixgraph methods for structure detection
o*misc.cMiscellaneous methods
o*nodesel_master.cNode selector for coordination of master and original formulation
o*nodesel_master.hNode selector for coordination of master and original formulation
o*objdialog.cppC++ wrapper for dialogs
o*objdialog.hC++ wrapper for dialogs
o*objpricer_gcg.hGCG variable pricer
o*pricer_gcg.cppPricer for generic column generation
o*pricer_gcg.hGCG variable pricer
o*pub_bliss.hHelper functions for automorphism detection
o*pub_decomp.hPublic methods for working with decomposition structures
o*pub_gcgcol.hPublic methods for working with gcg columns
o*pub_gcgheur.hPublic methods for GCG heuristics
o*pub_gcgpqueue.h
o*pub_gcgvar.hPublic methods for GCG variables
o*reader_blk.cBLK file reader for structure information
o*reader_blk.hBLK file reader for structure information
o*reader_dec.cDEC file reader for structure information
o*reader_dec.hDEC file reader for structure information
o*reader_gp.cGP file reader writing gnuplot files
o*reader_gp.hGP file reader writing gnuplot files
o*reader_ref.cREF file reader for structure information
o*reader_ref.hREF file reader for structure information
o*relax_gcg.cGCG relaxator
o*relax_gcg.hGCG relaxator
o*rowgraph.hA row graph where each row is a node and rows are adjacent if they share a variable
o*rowgraph_def.hA row graph where each row is a node and rows are adjacent if they share a variable
o*scip_misc.cVarious SCIP helper methods
o*scip_misc.hVarious SCIP helper methods
o*sepa_basis.cBasis separator
o*sepa_basis.hBasis separator
o*sepa_master.cMaster separator
o*sepa_master.hMaster separator
o*solver_cplex.cCplex solver for pricing problems
o*solver_cplex.hCplex solver for pricing problems
o*solver_knapsack.cKnapsack solver for pricing problems
o*solver_knapsack.hKnapsack solver for pricing problems
o*solver_mip.cPricing solver solving the pricing problem as a sub-MIP, using SCIP
o*solver_mip.hMip solver for pricing problems
o*stat.cSome printing methods for statistics
o*stat.hPrints information about the best decomposition
o*type_branchgcg.hType definitions for branching rules in GCG projects
o*type_decomp.hType definitions for decomposition information in GCG projects
o*type_detector.hType definitions for detectors in GCG projects
o*type_gcgcol.hType definitions for gcg column data structure
o*type_gcgpqueue.hType definitions for priority queue
o*type_masterdiving.hType definitions for GCG diving heuristics on the master variables
o*type_origdiving.hType definitions for GCG diving heuristics on the original variables
o*type_solver.hType definitions for pricing problem solvers in GCG project
o*weights.cppWeight class for graphs
o*weights.hWeight class for graphs
\*xternal.cMain document page