Limbo
|
solve linear programming problem with dual min-cost flow More...
#include <cstdlib>
#include <iostream>
#include <cassert>
#include <string>
#include <cctype>
#include <ctime>
#include <boost/cstdint.hpp>
#include <boost/unordered_map.hpp>
#include <boost/foreach.hpp>
#include <boost/typeof/typeof.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <limbo/solvers/lpmcf/Lgf.h>
#include <limbo/parsers/lp/bison/LpDriver.h>
#include <limbo/math/Math.h>
Go to the source code of this file.
Classes | |
class | limbo::solvers::lpmcf::hash_pair< T1, T2 > |
hash calculator for pairs More... | |
class | limbo::solvers::lpmcf::LpDualMcf< T > |
LP solved with min-cost flow. More... | |
class | limbo::solvers::lpmcf::LpDualMcf< T >::variable_type |
variable \(x_i\) in the primal linear programming problem. standard format: \(l_i \le x_i \le u_i\) maps to node \(i\), arcs from node \(i\) to node \(st\). More... | |
class | limbo::solvers::lpmcf::LpDualMcf< T >::constraint_type |
constraint object in the primal linear programming problem. standard format: \(x_i - x_j \ge c_{ij}\) maps to arc \(x_i \rightarrow x_j, \textrm{cost} = -c_{ij}\). More... | |
Namespaces | |
limbo | |
namespace for Limbo | |
limbo::solvers | |
namespace for Limbo.Solvers | |
limbo::solvers::lpmcf | |
namespace for Limbo.Solvers.lpmcf | |
solve linear programming problem with dual min-cost flow
Lemon is used as min-cost flow solver
Definition in file LpDualMcf.h.