File List
Here is a list of all files with brief descriptions:
[detail level 12345]
► resources | |
► devs | |
branching | |
cutting | |
► detection | |
► classifiers | |
clscons | |
clsvar | |
► detectors | |
all | |
howtoadd | |
howtouse | |
misc | |
presolving | |
pricing | |
► example-projects | |
kidney | |
installation | |
► misc | |
► runtime_data | |
check.short.gcg-3.0.4.linux.x86_64.gnu.opt.spx2.orlab.default_release.default.set | |
parameters.set | |
► users | |
► features | |
interactive-menu | |
► use-cases | |
u1 | |
u2 | |
u3 | |
u4 | |
u5 | |
u6 | |
u7 | |
u8 | |
► src | |
► graph | |
bipartitegraph.h | |
bipartitegraph_def.h | A bipartite graph |
bridge.h | Bridge |
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 |
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 |
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 |
matrixgraph.h | Miscellaneous matrixgraph methods for structure detection |
matrixgraph_def.h | Miscellaneous matrixgraph methods for structure detection |
priority_graph.h | |
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 |
weights.cpp | Weight class for graphs |
weights.h | Weight class for graphs |
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 |
bliss_automorph.cpp | Automorphism recognition of SCIPs |
bliss_automorph.h | Automorphism recognition of SCIPs |
bliss_automorph.hpp | Automorphism recognition (C++ interface) |
branch_bpstrong.c | Generic branch-and-price strong branching heuristics |
branch_bpstrong.h | Generic branch and price strong branching as described in Pecin, D., Pessoa, A., Poggi, M., Uchoa, E. Improved branch-cut-and-price for capacitated vehicle routing. In: Math. Prog. Comp. 9:61-100. Springer (2017) |
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 |
class_conspartition.cpp | Class representing a partition of a set of constraints |
class_conspartition.h | Class representing a partition of a set of constraints |
class_detprobdata.cpp | Class storing partialdecomps and the problem matrix |
class_detprobdata.h | Class storing partialdecs and the problem matrix |
class_indexpartition.cpp | Generalization of ConsPartition and VarPartition |
class_indexpartition.h | Generalization of ConsPartition and VarPartition |
class_partialdecomp.cpp | Class storing incomplete decompositions |
class_partialdecomp.h | Class storing (potentially incomplete) decompositions |
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_stabilization.cpp | Class with functions for dual variable smoothing |
class_stabilization.h | Class with functions for dual variable smoothing |
class_varpartition.cpp | Class representing a partition of a set of variables |
class_varpartition.h | Class representing a partition of a set of variables |
clscons_consnamelevenshtein.cpp | Classifies constraints according to levenshtein distance graph of their names |
clscons_consnamelevenshtein.h | Classifies constraints according to levenshtein distance graph of their names |
clscons_consnamenonumbers.cpp | Classifies constraints according to names (without digits) |
clscons_consnamenonumbers.h | Classifies constraints according to names (without digits) |
clscons_gamsdomain.cpp | Classifies by domains from which constraints are created TODO: what is together in one class? |
clscons_gamsdomain.h | Classifies by domains from which constraints are created TODO: what is together in one class? |
clscons_gamssymbol.cpp | Gamssymbol constraint classifier (classifies by corresponding GAMS symbol) |
clscons_gamssymbol.h | Constraints which have the same symbol are put into same class |
clscons_miplibconstypes.cpp | Classifies constraints according to their miplib constypes |
clscons_miplibconstypes.h | Classifies constraints according to their miplib constypes |
clscons_nnonzeros.cpp | Classifies constraints according to their nonzero entries |
clscons_nnonzeros.h | Classifies constraints according to their nonzero entries |
clscons_scipconstypes.cpp | Classifies constraints according to their scip constypes |
clscons_scipconstypes.h | Classifies constraints according to their scip constypes |
clsvar_gamsdomain.cpp | Classifies by domains from which variables are created TODO: what is together in one class? |
clsvar_gamsdomain.h | Classifies by domains from which variables are created TODO: what is together in one class? |
clsvar_gamssymbol.cpp | Variables which have the same symbol are put into same class |
clsvar_gamssymbol.h | Variables which have the same symbol are put into same class |
clsvar_objvalues.cpp | Classifies variables according to their objective function values |
clsvar_objvalues.h | Classifies variables according to their objective function values |
clsvar_objvaluesigns.cpp | Classifies variables according to their objective function value signs |
clsvar_objvaluesigns.h | Classifies variables according to their objective function value signs |
clsvar_scipvartypes.cpp | Classifies variables according to their scip vartypes |
clsvar_scipvartypes.h | Classifies variables according to their scip vartypes |
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 |
cons_decomp.cpp | Constraint handler for structure detection |
cons_decomp.h | Constraint handler for structure detection |
cons_decomp.hpp | C++ interface of cons_decomp |
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_compgreedily.cpp | Detector compgreedily (assigns the open cons and open vars of the partialdec greedily) |
dec_compgreedily.h | Compgreedily detector |
dec_connected_noNewLinkingVars.cpp | Detector connected_noNewLinkingVars (assigns all dependent open conss and vars and completes the partialdec by bfs) |
dec_connected_noNewLinkingVars.h | Connected_noNewLinkingVars detector |
dec_connectedbase.cpp | Detector connectedbase (completes the partialdec by bfs) |
dec_connectedbase.h | Connectedbase detector |
dec_consclass.cpp | Detector consclass (put your description here) |
dec_consclass.h | Consclass detector |
dec_constype.cpp | Detector constype (put your description here) |
dec_constype.h | Constype detector |
dec_dbscan.cpp | Detector DBSCAN |
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 for set covering constraints |
dec_generalmastersetcover.h | Generalmastersetcover detector |
dec_generalmastersetpack.cpp | Detector for set packing constraints |
dec_generalmastersetpack.h | Generalmastersetpack detector |
dec_generalmastersetpart.cpp | Detector for set partitioning constraints |
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_mst.cpp | Minimum spanning tree clustering detector |
dec_mst.h | Detector for diagonal (bordered) structures via Minimum Spanning Tree clustering algorithm |
dec_neighborhoodmaster.cpp | Detector neighborhoodmaster (This detector calculates cons-cons adjacency (if not already done), sorts constraints according size of neighborhood. Searching two consecutive constraints with largest size difference (according neighborhood size) in sorted constraints. All constraints having a larger neighborhood than the second one are assigned to the master) |
dec_neighborhoodmaster.h | Neighborhoodmaster detector |
dec_postprocess.cpp | Checks if there are master constraints that can be assigned to one block (without any other changes) |
dec_postprocess.h | Postprocess detector |
dec_staircase_lsp.cpp | Detector for staircase_lsp matrices |
dec_staircase_lsp.h | Staircase compontent detector |
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 |
def.h | Common defines and data types used in all packages of GCG |
dialog_explore.cpp | Dialog menu for exploring decompositions |
dialog_explore.h | Dialog menu for exploring decompositions |
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 |
gcg_general.c | Gcg general public methods |
gcg_general.h | Gcg general public 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 | Template functions for sorting |
gcgvar.c | GCG variable access functions |
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 |
main.c | Main file for C compilation |
masterplugins.c | SCIP plugins for generic column generation |
masterplugins.h | SCIP plugins for generic column generation |
misc.c | Miscellaneous methods |
miscvisualization.cpp | Miscellaneous methods for visualizations |
miscvisualization.h | Miscellaneous methods for visualizations |
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 settings for visualization readers |
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 | Methods for storing priced cols (based on SCIP's separation storage) |
pricestore_gcg.h | Methods for storing priced cols (based on SCIP's separation storage) |
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 |
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 | BLK file reader for structure information |
reader_blk.h | BLK file reader for structure information |
reader_cls.cpp | CLS reader for writing files containing classification data |
reader_cls.h | CLS reader for writing files containing classification data |
reader_dec.cpp | DEC file reader for structure information |
reader_dec.h | DEC file reader for structure information |
reader_gp.cpp | GP file reader writing decompositions to gnuplot files |
reader_gp.h | GP file reader writing decompositions to 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 partialdecs to LaTeX files |
reader_tex.h | Parameter settings for visualization readers |
relax_gcg.c | GCG relaxator |
relax_gcg.h | GCG relaxator |
scip_misc.c | Various SCIP helper methods |
scip_misc.h | Various SCIP helper methods |
scoretype.c | |
scoretype.h | Miscellaneous methods for working with SCORETYPE |
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 |
struct_branchgcg.h | Data structures for branching rules |
struct_colpool.h | Data structures for storing cols in a col pool |
struct_consclassifier.h | Data structures for constraint classifiers |
struct_decomp.h | Structure information for decomposition information in GCG projects |
struct_detector.h | Data structures for detectors |
struct_gcgcol.h | Data structure to store columns (solutions from a pricing problem) |
struct_gcgpqueue.h | Data structure for priority queue |
struct_pricestore_gcg.h | Datastructures for storing priced cols |
struct_pricingjob.h | Data structure for pricing jobs |
struct_pricingprob.h | Data structure to store pricing problem information |
struct_solver.h | Data structures for solvers |
struct_varclassifier.h | Data structures for variable classifiers |
struct_vardata.h | Data structures for GCG variable data |
type_branchgcg.h | Type definitions for branching rules in GCG projects |
type_classifier.h | Type definitions for classifier in GCG project |
type_colpool.h | Type definitions for storing cols in a col pool |
type_consclassifier.h | Type definitions for constraints classifier in GCG projects |
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_parameter.h | Type definitions for parameters in GCG project |
type_pricestore_gcg.h | Type definitions for storing priced cols |
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_scoretype.h | Type definition for score type |
type_solver.h | Type definitions for pricing problem solvers in GCG project |
type_varclassifier.h | Type definitions for variable classifier in GCG projects |
wrapper_partialdecomp.h | Provides wrapping to have Partialdecomps as parameters in C-conform function headers with C++ implementations |
CHANGELOG | |
xternal.c | Documentation page for GCG's C-API (no other pages) |
- © 2010-2021 by Operations Research, RWTH Aachen University, Imprint Privacy Policy
- Generated on Mon Dec 20 2021 10:25:33 for Generic Column Generation by 1.8.17