COIN-OR::LEMON - Graph Library

Opened 8 years ago

Last modified 17 months ago

#328 assigned enhancement

Heuristic MinCostFlow and MinCostMaxFlow

Reported by: kpeter Owned by: kpeter
Priority: major Milestone: LEMON 1.5 release
Component: core Version: hg main
Keywords: Cc:
Revision id:

Description

It could be worthwhile to create a heuristic min cost flow solver class named MinCostFlow. It would have the same interface as the single algorithms, but it could try to select the best algorithm to run according to the parameters of the problem (size of the graph, density, max. capacity etc.). This class could be used in e.g. thew dimacs solver.

Similarly, we could have a heuristic MinCostMaxFlow using Preflow and MinCostFlow. Or the interface of MinCostFlow could be extended to support min cost max flow. See also #244.

This ticket is a follow-up of #180.

Change History (4)

comment:1 Changed 8 years ago by kpeter

  • Status changed from new to assigned

What do you think?

  • Do we like to have such wrapper classes apart from the single algorithm classes?
  • Which solution/interface do you prefer for min cost max flow? (See also #224)

comment:2 Changed 8 years ago by kpeter

I'm sorry. #244, not #224.

comment:3 Changed 5 years ago by alpar

  • Milestone changed from LEMON 1.3 release to LEMON 1.4 release

comment:4 Changed 17 months ago by alpar

  • Milestone changed from LEMON 1.4 release to LEMON 1.5 release
Note: See TracTickets for help on using tickets.