COIN-OR::LEMON - Graph Library

Changeset 755:134852d7fb0a in lemon-1.2 for lemon/network_simplex.h


Ignore:
Timestamp:
10/10/09 08:18:46 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Insert citations into the doc (#184)

  • Add general citations to modules.
  • Add specific citations for max flow and min cost flow algorithms.
  • Add citations for the supported LP and MIP solvers.
  • Extend the main page.
  • Replace inproceedings entries with the journal versions.
  • Add a new bibtex entry about network simplex.
  • Remove unwanted entries.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/network_simplex.h

    r730 r755  
    4141  ///
    4242  /// \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.
    4446  /// This algorithm is a specialized version of the linear programming
    4547  /// simplex method directly for the minimum cost flow problem.
Note: See TracChangeset for help on using the changeset viewer.