equal
deleted
inserted
replaced
38 |
38 |
39 /// \brief Implementation of the primal Network Simplex algorithm |
39 /// \brief Implementation of the primal Network Simplex algorithm |
40 /// for finding a \ref min_cost_flow "minimum cost flow". |
40 /// for finding a \ref min_cost_flow "minimum cost flow". |
41 /// |
41 /// |
42 /// \ref NetworkSimplex implements the primal Network Simplex algorithm |
42 /// \ref NetworkSimplex implements the primal Network Simplex algorithm |
43 /// for finding a \ref min_cost_flow "minimum cost flow". |
43 /// for finding a \ref min_cost_flow "minimum cost flow" |
|
44 /// \ref amo93networkflows, \ref dantzig63linearprog, |
|
45 /// \ref kellyoneill91netsimplex. |
44 /// This algorithm is a specialized version of the linear programming |
46 /// This algorithm is a specialized version of the linear programming |
45 /// simplex method directly for the minimum cost flow problem. |
47 /// simplex method directly for the minimum cost flow problem. |
46 /// It is one of the most efficient solution methods. |
48 /// It is one of the most efficient solution methods. |
47 /// |
49 /// |
48 /// In general this class is the fastest implementation available |
50 /// In general this class is the fastest implementation available |