Armin_Sadeghi
|
b628182d2e
|
added to the branch
|
11 years ago |
Armin_Sadeghi
|
b002ab320d
|
added to the branch
|
11 years ago |
Armin_Sadeghi
|
5d3f16a401
|
heuristics improved slightly
|
11 years ago |
Alinson S. Xavier
|
9c3701037f
|
Accept number of clusters; output to tmp/
|
11 years ago |
Alinson S. Xavier
|
d726fd34b4
|
Print number of cuts added, even if zero
|
11 years ago |
Alinson S. Xavier
|
9398a8d9ce
|
Check return value of user function
|
11 years ago |
Alinson S. Xavier
|
11ed52191a
|
Remove warnings
|
11 years ago |
Alinson S. Xavier
|
745f6f755c
|
Fix read_solution and implement solution checker
|
11 years ago |
Alinson S. Xavier
|
b01b3fe31c
|
DEBUG level by default, and no combs
|
11 years ago |
Alinson S. Xavier
|
108b41997a
|
Formatted abort_if
|
11 years ago |
Alinson S. Xavier
|
f8943fb1ec
|
Bugfix. Rows not in cplex should have index -1
|
11 years ago |
Alinson S. Xavier
|
2e370e39ef
|
Armin's heuristics
|
11 years ago |
Alinson S. Xavier
|
188367e189
|
Create output directory
|
11 years ago |
Alinson S. Xavier
|
f82002aa11
|
Implement comb cuts separation
|
11 years ago |
Alinson S. Xavier
|
ce206f5b7a
|
Remove cuts according to age
|
11 years ago |
Alinson S. Xavier
|
cb580892b9
|
Implement simple cut pool; avoid duplicate cuts
|
11 years ago |
Alinson S. Xavier
|
66b3eef3a4
|
Run multiple rounds with decreasing cut violation; remove slack constraints
|
11 years ago |
Alinson S. Xavier
|
480aae2bd5
|
Rudimentary benchmark scripts
|
11 years ago |
Alinson S. Xavier
|
1c258caa7f
|
Highlight integer edges
|
11 years ago |
Alinson S. Xavier
|
6e4d69e289
|
Split gtsp.c
|
11 years ago |
Alinson S. Xavier
|
461aa31475
|
Hide node labels for large graphs
|
11 years ago |
Alinson S. Xavier
|
554dd639e5
|
Reduce number of edges of the flow digraph
|
11 years ago |
Alinson S. Xavier
|
c0d50a53e2
|
Implement pause function
|
11 years ago |
Alinson S. Xavier
|
6e4bcdf4a3
|
Default number of clusters
|
11 years ago |
Alinson S. Xavier
|
2ca92fa2dc
|
Remove warnings and dead code
|
11 years ago |
Alinson S. Xavier
|
e04edbe7ef
|
Remove subcluster cuts
|
11 years ago |
Alinson S. Xavier
|
55c4485137
|
Fix cut edges mapping and cluster node activation
|
11 years ago |
Alinson S. Xavier
|
64351aae34
|
Unify add_cut; organize functions
|
11 years ago |
Alinson S. Xavier
|
882739c378
|
Extract two other subtour separation methods and cut edges mapping
|
11 years ago |
Alinson S. Xavier
|
45946b235d
|
Extract GTSP_find_exact_subtour_elimination_cuts_1
|
11 years ago |
Alinson S. Xavier
|
2a2fd6713b
|
Extract method to build flow digraph
|
11 years ago |
Alinson S. Xavier
|
81995ac378
|
Draw fractional solutions
|
11 years ago |
Alinson S. Xavier
|
4ce5ae9f33
|
Implement subcluster cuts
|
11 years ago |
Alinson S. Xavier
|
84db3006cd
|
Fix labels overlapping nodes
|
11 years ago |
Alinson S. Xavier
|
8af349c106
|
Additional subtour cuts
|
11 years ago |
Alinson S. Xavier
|
5fe42908b4
|
Fix subtour cuts, create separate main functions
|
11 years ago |
Alinson S. Xavier
|
75a016c8c2
|
Add functions to find minimum cut from a maximum flow
|
11 years ago |
Alinson S. Xavier
|
ad71e2317e
|
Rename Makefile.example
|
11 years ago |
Alinson S. Xavier
|
145b60f9d6
|
Remove IDE files
|
11 years ago |
Alinson S. Xavier
|
2da8b5db35
|
Remove extra file
|
11 years ago |
Alinson S. Xavier
|
91a2731d35
|
Implement max flow algorithm
|
11 years ago |
Alinson S. Xavier
|
42f96fd01e
|
FIx log_debug
|
11 years ago |
Alinson S. Xavier
|
8ced1568bd
|
New logging macros
|
11 years ago |
Alinson S. Xavier
|
6891c0d0be
|
First version of the GTSP branch-and-bound solver
|
11 years ago |
Alinson S. Xavier
|
c6d3dee71c
|
Rename variables
|
11 years ago |
Alinson S. Xavier
|
51dc42554b
|
Remove redundant check
|
11 years ago |
Alinson S. Xavier
|
d4905b7f94
|
Store optimal integral solution upon finding it
|
11 years ago |
Alinson S. Xavier
|
4a97719b18
|
Move TSP instances to their own directory
|
11 years ago |
Alinson S. Xavier
|
095e621654
|
First version of the script to draw the solutions
|
11 years ago |
Alinson S. Xavier
|
aa0c40b262
|
Implement random cluster generation
|
11 years ago |