Changeset 812:4b1b378823dc in lemon1.2 for lemon/network_simplex.h
 Timestamp:
 11/12/09 23:49:05 (10 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 30323866356537663935353430623930626534653939636630353730643832346265623131623731
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/network_simplex.h
r811 r812 44 44 /// \ref amo93networkflows, \ref dantzig63linearprog, 45 45 /// \ref kellyoneill91netsimplex. 46 /// This algorithm is a specialized version of the linear programming47 /// simplex method directly for the minimum cost flow problem.48 /// It is one of the most efficient solution methods.46 /// This algorithm is a highly efficient specialized version of the 47 /// linear programming simplex method directly for the minimum cost 48 /// flow problem. 49 49 /// 50 /// In general this classis the fastest implementation available51 /// in LEMON for th e minimum cost flowproblem.52 /// Moreover it supports both directions of the supply/demand inequality50 /// In general, %NetworkSimplex is the fastest implementation available 51 /// in LEMON for this problem. 52 /// Moreover, it supports both directions of the supply/demand inequality 53 53 /// constraints. For more information, see \ref SupplyType. 54 54 /// … … 59 59 /// 60 60 /// \tparam GR The digraph type the algorithm runs on. 61 /// \tparam V The valuetype used for flow amounts, capacity bounds61 /// \tparam V The number type used for flow amounts, capacity bounds 62 62 /// and supply values in the algorithm. By default, it is \c int. 63 /// \tparam C The valuetype used for costs and potentials in the63 /// \tparam C The number type used for costs and potentials in the 64 64 /// algorithm. By default, it is the same as \c V. 65 65 /// 66 /// \warning Both valuetypes must be signed and all input data must66 /// \warning Both number types must be signed and all input data must 67 67 /// be integer. 68 68 /// … … 127 127 /// By default, \ref BLOCK_SEARCH "Block Search" is used, which 128 128 /// proved to be the most efficient and the most robust on various 129 /// test inputs according to our benchmark tests.129 /// test inputs. 130 130 /// However, another pivot rule can be selected using the \ref run() 131 131 /// function with the proper parameter. … … 638 638 std::numeric_limits<Value>::infinity() : MAX) 639 639 { 640 // Check the valuetypes640 // Check the number types 641 641 LEMON_ASSERT(std::numeric_limits<Value>::is_signed, 642 642 "The flow type of NetworkSimplex must be signed"); … … 730 730 /// If it is not used before calling \ref run(), the upper bounds 731 731 /// will be set to \ref INF on all arcs (i.e. the flow value will be 732 /// unbounded from above on each arc).732 /// unbounded from above). 733 733 /// 734 734 /// \param map An arc map storing the upper bounds.
Note: See TracChangeset
for help on using the changeset viewer.