COIN-OR::LEMON - Graph Library

Timeline



04/26/09:

20:41 Ticket #270 (Support infinite and negative data in NetworkSimplex) reopened by Peter Kovacs
There is outstanding issue of [comment:3 reworking the NetworkSimplex?
20:39 Ticket #267 (Revise the interface of MinCostArborescence) closed by Peter Kovacs
fixed: [029a48052c67] went to the main branch.
06:03 Ticket #272 (Backport #268 related bugfix to LEMON-1.0) created by Alpar Juttner
Namely, the changesets [f2d6d3446adf] and [4137ef9aacc6] from #268 are …
05:57 Development edited by Alpar Juttner
(diff)

04/25/09:

16:59 Ticket #256 (Support all LP/MIP solvers in the CMAKE config) closed by Alpar Juttner
done
16:58 Ticket #270 (Support infinite and negative data in NetworkSimplex) closed by Alpar Juttner
done
16:56 Ticket #266 (Revise the interface of Circulation and Suurballe) closed by Alpar Juttner
done: Replying to kpeter: > Now only one changeset is relevant …

04/24/09:

22:07 Ticket #219 (Enable <= supply requirement in Network Simplex) closed by Peter Kovacs
fixed: Replying to alpar: > Why? I think both are natural and …
22:05 Ticket #271 (Provide output in dimacs-solver) created by Peter Kovacs
Currently dimacs-solver reports only the shortest path length …
16:12 Ticket #270 (Support infinite and negative data in NetworkSimplex) created by Peter Kovacs
It would be nice to support infinte capacities (upper bounds), …
14:49 Ticket #269 (Function type interface for Circulation) created by Peter Kovacs
It would be nice to have a function type interface for Circulation. …
11:17 Ticket #234 (Port and revise Network Simplex algorithm) closed by Alpar Juttner
fixed
11:16 Ticket #268 (min_cost_flow_test.cc does not compile with VS2005) closed by Alpar Juttner
fixed

04/23/09:

08:49 Ticket #268 (min_cost_flow_test.cc does not compile with VS2005) created by Akos Ladanyi
[…]

04/22/09:

21:12 Ticket #234 (Port and revise Network Simplex algorithm) reopened by Peter Kovacs
Other questions have arisen. 1. ProblemType and problemType() in …
12:34 Ticket #267 (Revise the interface of MinCostArborescence) created by Peter Kovacs
1. Check the interface (and the documentaton). 2. Rename DefXyz
12:22 Ticket #266 (Revise the interface of Circulation and Suurballe) reopened by Peter Kovacs
I've reopened this ticket because the Suurballe interface should be …

04/21/09:

14:52 Ticket #266 (Revise the interface of Circulation and Suurballe) closed by Alpar Juttner
done: Replying to kpeter: > Replying to kpeter: > > …
14:49 Ticket #109 (Document function-type interface of .lgf tools) closed by Alpar Juttner
done: [a3402913cffe] is in the main branch. The template names are …
14:48 Ticket #264 (Improvements and fixes for some algorithms) closed by Alpar Juttner
fixed
14:44 Ticket #254 (Support real value types in NetworkSimplex) closed by Alpar Juttner
done
14:38 Ticket #234 (Port and revise Network Simplex algorithm) closed by Alpar Juttner
fixed: All the relevant changesets are in the main branch now.

04/20/09:

15:04 Véletlen gráfok generálása created by Erika Kovács
14:31 Temak edited by Erika Kovács
(diff)

04/18/09:

21:15 LocalSite edited by Peter Kovacs
(diff)
20:31 Ticket #265 (Imrovements for the interface of the matching algorithms) closed by Alpar Juttner
fixed: [7ac52d6a268e] and [d657c71db7db] are in the main branch.
20:09 Gráfelméleti sejtés-ellenőrző modul fejlesztése edited by Peter Kovacs
(diff)

04/17/09:

16:10 Ticket #266 (Revise the interface of Circulation and Suurballe) created by Peter Kovacs
When the interface of NetworkSimplex is clarified and accepted (see …

04/15/09:

06:31 Ticket #263 (Small improvements) closed by Alpar Juttner
fixed: Replying to kpeter: > [65fbcf2f978a] is an extended …
06:30 Ticket #262 (Connectivity tools are missing from the doc) closed by Alpar Juttner
fixed: Replying to kpeter: > [7c12061bd271] ports some images and …
00:42 Ticket #265 (Imrovements for the interface of the matching algorithms) created by Peter Kovacs
I have some idea and questions about the interface of the matching …
00:17 Ticket #264 (Improvements and fixes for some algorithms) created by Peter Kovacs
00:04 Ticket #263 (Small improvements) created by Peter Kovacs

04/14/09:

15:56 Irányítatlan gráfok k-élösszefüggővé irányítása created by Erika Kovács
15:39 Temak edited by Erika Kovács
(diff)
15:35 Temak edited by Erika Kovács
(diff)
11:00 Ticket #262 (Connectivity tools are missing from the doc) created by Peter Kovacs
All the tools in connectivity.h are missing from the doc. Either the …
09:43 Ticket #190 (Standard maps should be reference maps) closed by Alpar Juttner
fixed: Replying to kpeter: > I've created another changeset …
08:41 WikiStart edited by Alpar Juttner
(diff)

04/11/09:

14:31 Ticket #261 (Support floating-point data in min-cost flow algorithms) created by Alpar Juttner
This is a follow-up of #254.

04/10/09:

06:55 Ticket #242 (LP related warnings) closed by Alpar Juttner
wontfix: The same happens with CBC-2.2.2. The problem is probably not on our …
06:39 Ticket #260 (lp_test and mip_test seem to succeed despite CPLEX license problems) closed by Alpar Juttner
fixed
06:35 Ticket #9 (Verbosity of the messages for CPLEX) closed by Alpar Juttner
fixed: I merged everything here into a single chgset and pushed to the main …

04/09/09:

17:06 Ticket #204 (CBC MIP solver interface) closed by Alpar Juttner
done: Replying to deba: > See ticket #9. OK. So, I close this one.

04/07/09:

13:55 Ticket #160 (Find more appropriate names for InvertableMap and DescriptorMap) closed by Alpar Juttner
fixed: Replying to kpeter: > There is a strange sentence in the …
13:49 Ticket #259 (tools/lgf-gen.cc does not compile with MSVC) closed by Alpar Juttner
fixed: Solved in [ab6da8cf5ab2]
13:49 Ticket #258 (tools/dimacs-solver.cc does not compile with MSVC) closed by Alpar Juttner
fixed: Solved in [24682336c38e].

04/06/09:

18:23 Ticket #260 (lp_test and mip_test seem to succeed despite CPLEX license problems) created by Akos Ladanyi
lp_test and mip_test print a message and succeed in case CPLEX is …
17:49 Ticket #259 (tools/lgf-gen.cc does not compile with MSVC) created by Akos Ladanyi
tools/lgf-gen.cc does not compile with MSVC.
17:48 Ticket #258 (tools/dimacs-solver.cc does not compile with MSVC) created by Akos Ladanyi
tools/dimacs-solver.cc does not compile with MSVC.
06:15 Ticket #255 (Glpk basis must be updated manually) closed by Alpar Juttner
fixed: The changesets are in the main branch now, but with changed commit …

04/02/09:

10:43 Ticket #257 (Create release branch 1.1 and clean up doc) created by Alpar Juttner
A release branch is to be made then we must clean up the documentation …
05:34 Ticket #256 (Support all LP/MIP solvers in the CMAKE config) created by Alpar Juttner
Up to now, only GLPK is supported.

04/01/09:

21:03 Ticket #255 (Glpk basis must be updated manually) created by Balazs Dezso
The basis must be computed before calling glp_simplex(). The …

03/31/09:

05:56 Ticket #243 (Handling negative/infinity capacities in the dimacs readers) closed by Alpar Juttner
done

03/29/09:

21:42 Ticket #248 (Various doc improvements) closed by Alpar Juttner
fixed: Replying to kpeter: > I attached the modified changeset …
08:51 Ticket #242 (LP related warnings) reopened by Alpar Juttner
Replying to deba: > I use Clp 1.9, and I did not get …
07:48 Ticket #253 (Improve tests for timer and counter tools) closed by Alpar Juttner
fixed: Replying to kpeter: > [4cc4140e7fbb] improves the test …

03/28/09:

09:58 WikiStart edited by Alpar Juttner
(diff)
09:12 WikiStart edited by Alpar Juttner
(diff)

03/27/09:

18:56 IssueTracker edited by Peter Kovacs
(diff)
18:43 Ticket #254 (Support real value types in NetworkSimplex) created by Peter Kovacs
17:47 Ticket #253 (Improve tests for timer and counter tools) created by Peter Kovacs
16:58 Ticket #252 (Smaller iterator classes for some graph structures) created by Peter Kovacs
All the NodeIt, ArcIt, EdgeIt etc. iterator classes stores a …
16:44 Ticket #251 (More efficient graph copying) created by Peter Kovacs
Is there any way to make graph copying faster for graph types like …
16:33 Ticket #250 (Extensions for the interface of paths) created by Peter Kovacs
1. Path structures have a function nth(int n) for getting the n
16:19 Ticket #249 (Bidirectional Bfs and Dijkstra) created by Peter Kovacs
It would be nice to have bidirectional Bfs and Dijkstra implementation …
16:06 Ticket #248 (Various doc improvements) created by Peter Kovacs
15:45 Ticket #247 (DegMap) created by Peter Kovacs
There are InDegMap and OutDegMap classes for directed graphs. So …
15:11 Ticket #246 (s() and t() as an alias for source() and target()) created by Peter Kovacs
As we have u() and v() for undirected graphs, it seems to be a …
10:38 Ticket #245 (Fixes in the scripts) closed by Alpar Juttner
fixed
06:22 Ticket #245 (Fixes in the scripts) created by Peter Kovacs
The attached changesets contain fixes for the scripts.
03:58 License edited by Peter Kovacs
(diff)
Note: See TracTimeline for information about the timeline view.