Files @ r640:6c408d864fa1

Location: LEMON/LEMON-main/tools/Makefile.am

Load file history 
r640:6c408d864fa1
307 B
text/plain
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Support negative costs and bounds in NetworkSimplex (#270) * The interface is reworked to support negative costs and bounds. - ProblemType and problemType() are renamed to SupplyType and supplyType(), see also #234. - ProblemType type is introduced similarly to the LP interface. - 'bool run()' is replaced by 'ProblemType run()' to handle unbounded problem instances, as well. - Add INF public member constant similarly to the LP interface. * Remove capacityMap() and boundMaps(), see also #266. * Update the problem definition in the MCF module. * Remove the usage of Circulation (and adaptors) for checking feasibility. Check feasibility by examining the artifical arcs instead (after solving the problem). * Additional check for unbounded negative cycles found during the algorithm (it is possible now, since negative costs are allowed). * Fix in the constructor (the value types needn't be integer any more), see also #254. * Improve and extend the doc. * Rework the test file and add test cases for negative costs and bounds.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
if WANT_TOOLS



bin_PROGRAMS += \

	tools/dimacs-solver \

	tools/dimacs-to-lgf \

	tools/lgf-gen



dist_bin_SCRIPTS += tools/lemon-0.x-to-1.x.sh



endif WANT_TOOLS



tools_dimacs_solver_SOURCES = tools/dimacs-solver.cc

tools_dimacs_to_lgf_SOURCES = tools/dimacs-to-lgf.cc

tools_lgf_gen_SOURCES = tools/lgf-gen.cc