src Directory Reference

Files
file	branch_multinode.c [code]
	mutlinode branching rule for the set-partitioning part in cycle clustering application.
file	branch_multinode.h [code]
	multinode branching rule
file	cycplugins.c [code]
	SCIP plugins for cycle clustering of markov state models.
file	cycplugins.h [code]
	SCIP plugins for cycle clustering.
file	event_newsol.c [code]
	eventhdlr that adds new solutions to the candidate pool for the exchange heuristic
file	event_newsol.h [code]
	eventhdlr that adds new solutions to the candidate pool for the exchange heuristic
file	heur_cycgreedy.c [code]
	Greedy primal heuristic. States are assigned to clusters iteratively. At each iteration all possible assignments are computed and the one with the best change in objective value is selected.
file	heur_cycgreedy.h [code]
	Greedy primal heuristic. States are assigned to clusters iteratively. At each iteration all possible assignments are computed and the one with the best change in objective value is selected.
file	heur_cyckerlin.c [code]
	improvement heuristic that exchanges binary variables between clusters. Similar to the famous kernighan/lin heuristic for graph partitioning
file	heur_cyckerlin.h [code]
	Improvement heuristic that trades bin-variables between clusters.
file	heur_fuzzyround.c [code]
	primal heuristic that constructs a feasible solution from the lp-relaxation. Round only on the state-variables (binvars) and then reconstruct the rest of the variables accordingly.
file	heur_fuzzyround.h [code]
	primal heuristic that constructs a feasible solution from the lp-relaxation. Round only on the state-variables (binvars) and then reconstruct the rest of the variables accordingly.
file	heur_redsize.c [code]
	primal heuristic that solves the problem with a sparser matrix as a submip
file	heur_redsize.h [code]
	primal heuristic that solves the problem with a sparser matrix as a submip
file	main.c [code]
	Main file for C compilation.
file	probdata_cyc.c [code]
	problem data for cycle clustering problem
file	probdata_cyc.h [code]
	problem data for cycle clustering problem
file	reader_cyc.c [code]
	file reader for cycle clustering instances
file	reader_cyc.h [code]
	file reader for cycle clustering instances
file	sepa_edge.c [code]
	edge-separator. Separates triangle-inequalities in cycle clustering problem
file	sepa_edge.h [code]
	edge-separator. Separates triangle-inequalities in cycle clustering problem
file	sepa_partition.c [code]
	partition-separator. Searches for two partitions of size 2 and 3 (extension of triangle-inequalities).
file	sepa_partition.h [code]
	simple partition-separator
file	sepa_subtour.c [code]
	If there exists a transition forward along the cycle, then the state that the transition originates from can be reached only after another ncluster - 1 transitions. Therefore cycles with a number of transitions smaller than that can be separated.
file	sepa_subtour.h [code]
	Separate Subtours-Elimination inequalities in Cycle-Clustering Applications.