COIN-OR::LEMON - Graph Library

Opened 14 years ago

Last modified 7 years ago

#328 assigned enhancement

Heuristic MinCostFlow and MinCostMaxFlow

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


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 14 years ago by Peter Kovacs

Status: newassigned

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 14 years ago by Peter Kovacs

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

comment:3 Changed 11 years ago by Alpar Juttner

Milestone: LEMON 1.3 releaseLEMON 1.4 release

comment:4 Changed 7 years ago by Alpar Juttner

Milestone: LEMON 1.4 releaseLEMON 1.5 release
Note: See TracTickets for help on using tickets.