|
| | branch_multinode.c |
| | mutlinode branching rule for the set-partitioning part in cycle clustering application.
|
| |
| | branch_multinode.h |
| | multinode branching rule
|
| |
| | cycplugins.c |
| | SCIP plugins for cycle clustering of markov state models.
|
| |
| | cycplugins.h |
| | SCIP plugins for cycle clustering.
|
| |
| | event_newsol.c |
| | eventhdlr that adds new solutions to the candidate pool for the exchange heuristic
|
| |
| | event_newsol.h |
| | eventhdlr that adds new solutions to the candidate pool for the exchange heuristic
|
| |
| | heur_cycgreedy.c |
| | 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.
|
| |
| | heur_cycgreedy.h |
| | 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.
|
| |
| | heur_cyckerlin.c |
| | improvement heuristic that exchanges binary variables between clusters. Similar to the famous kernighan/lin heuristic for graph partitioning
|
| |
| | heur_cyckerlin.h |
| | Improvement heuristic that trades bin-variables between clusters.
|
| |
| | heur_fuzzyround.c |
| | 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.
|
| |
| | heur_fuzzyround.h |
| | 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.
|
| |
| | heur_redsize.c |
| | primal heuristic that solves the problem with a sparser matrix as a submip
|
| |
| | heur_redsize.h |
| | primal heuristic that solves the problem with a sparser matrix as a submip
|
| |
| | main.c |
| | Main file for C compilation.
|
| |
| | probdata_cyc.c |
| | problem data for cycle clustering problem
|
| |
| | probdata_cyc.h |
| | problem data for cycle clustering problem
|
| |
| | reader_cyc.c |
| | file reader for cycle clustering instances
|
| |
| | reader_cyc.h |
| | file reader for cycle clustering instances
|
| |
| | sepa_edge.c |
| | edge-separator. Separates triangle-inequalities in cycle clustering problem
|
| |
| | sepa_edge.h |
| | edge-separator. Separates triangle-inequalities in cycle clustering problem
|
| |
| | sepa_partition.c |
| | partition-separator. Searches for two partitions of size 2 and 3 (extension of triangle-inequalities).
|
| |
| | sepa_partition.h |
| | simple partition-separator
|
| |
| | sepa_subtour.c |
| | 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.
|
| |
| | sepa_subtour.h |
| | Separate Subtours-Elimination inequalities in Cycle-Clustering Applications.
|
| |