Changeset 956:141f9c0db4a3 in lemon for lemon/circulation.h
 Timestamp:
 03/06/10 15:35:12 (10 years ago)
 Branch:
 default
 Children:
 957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/circulation.h
r891 r956 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 60 60 /// \brief The type of supply map. 61 61 /// 62 /// The type of the map that stores the signed supply values of the 63 /// nodes. 62 /// The type of the map that stores the signed supply values of the 63 /// nodes. 64 64 /// It must conform to the \ref concepts::ReadMap "ReadMap" concept. 65 65 typedef SM SupplyMap; … … 142 142 \geq sup(u) \quad \forall u\in V, \f] 143 143 \f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A. \f] 144 144 145 145 The sum of the supply values, i.e. \f$\sum_{u\in V} sup(u)\f$ must be 146 146 zero or negative in order to have a feasible solution (since the sum … … 152 152 constraints have to be satisfied with equality, i.e. all demands 153 153 have to be satisfied and all supplies have to be used. 154 154 155 155 If you need the opposite inequalities in the supply/demand constraints 156 156 (i.e. the total demand is less than the total supply and all the demands … … 338 338 /// \param graph The digraph the algorithm runs on. 339 339 /// \param lower The lower bounds for the flow values on the arcs. 340 /// \param upper The upper bounds (capacities) for the flow values 340 /// \param upper The upper bounds (capacities) for the flow values 341 341 /// on the arcs. 342 342 /// \param supply The signed supply values of the nodes.
Note: See TracChangeset
for help on using the changeset viewer.