COIN-OR::LEMON - Graph Library

Timeline



07/23/10:

06:29 Changeset in lemon [999:c279b19abc62] by Peter Kovacs <kpeter@…>
Add a heuristic algorithm for the max clique problem (#380)

07/22/10:

10:15 Ticket #382 (LGF without arc maps) created by Peter Kovacs
Arc maps are not obligatory in LGF. However, it is problematic, if you …

07/21/10:

17:41 Ticket #381 (Simplified heaps without priority update) created by Peter Kovacs
The existing heap implementations in LEMON cointain an Item->int map …
16:50 Ticket #380 (A heuristic algorithm for the Maximum Clique problem) created by Peter Kovacs
The attached patch contains the implementation of a recent heurstic …

07/05/10:

07:54 Ticket #371 (Target graph is not cleared before graph copying) closed by Peter Kovacs
fixed

07/02/10:

23:58 Ticket #379 (Find odd cycles) created by Peter Kovacs
We could extend the functions bipartite() and …
23:31 Temak edited by Peter Kovacs
(diff)
23:24 Tranzitív lezárt created by Peter Kovacs
23:09 Ticket #378 (Transitive closure) created by Peter Kovacs
It would be nice to have a tool that generates the transitive closure …
22:39 Ticket #377 (Smaller version of StaticDigraph) created by Peter Kovacs
The current implementation of StaticDigraph stores 2n+4m int …
20:49 Temak edited by Peter Kovacs
(diff)
20:49 Különböző gráfformátumok kezelése edited by Peter Kovacs
(diff)
20:48 Különböző gráfformátumok kezelése edited by Peter Kovacs
Name changed from Gráfformátumok kezelése to Különböző gráfformátumok … (diff)
20:46 Különböző gráfformátumok kezelése created by Peter Kovacs
20:14 Temak edited by Peter Kovacs
(diff)
20:12 Heurisztikus útvonalkeresés edited by Peter Kovacs
(diff)
20:09 Heurisztikus útvonalkeresés created by Peter Kovacs
20:02 pyLemon modul fejlesztése edited by Peter Kovacs
(diff)
19:41 Metaheurisztikák implementálása edited by Peter Kovacs
(diff)
19:40 Utazóügynök feladat edited by Peter Kovacs
(diff)
19:33 Bináris formátum gráfok tárolására edited by Peter Kovacs
(diff)
19:28 Ticket #376 (A star (A*) algorithm) created by Peter Kovacs
It would be nice to have an A-star (A*) algorithm implementation in …

07/01/10:

07:15 Ticket #375 (Both lower and upper supply bounds in Network simplex) created by Alpar Juttner
The idea is to extend Network Simplex so that the form of the problems …

06/30/10:

14:51 MailingLists edited by Peter Kovacs
(diff)
14:50 LocalSite edited by Peter Kovacs
(diff)
14:49 Development edited by Peter Kovacs
(diff)
14:47 LemonRepos edited by Peter Kovacs
(diff)
13:17 IssueTracker edited by Peter Kovacs
(diff)

06/29/10:

19:09 IssueTracker edited by Peter Kovacs
(diff)
16:17 Ticket #374 (Functions for weakly connected components) created by Peter Kovacs
I suggest to have the following functions: […] which would work the …
16:06 Ticket #373 (Compile time assertion) created by Peter Kovacs
Compile time assertion would be useful in some cases (instead of …
14:57 IssueTracker edited by Peter Kovacs
(diff)
14:27 IssueTracker edited by Peter Kovacs
(diff)
Note: See TracTimeline for information about the timeline view.