min_cycle_ratio.hpp file
Functions
-
template<typename Graph, typename T, typename Fn1, typename Fn2, typename Mapping>auto min_cycle_ratio(const Graph& gra, T& r0, Fn1&& get_cost, Fn2&& get_time, Mapping&& dist, size_t max_iters = 1000) -> auto
- minimum cost-to-time cycle ratio problem
Function documentation
template<typename Graph, typename T, typename Fn1, typename Fn2, typename Mapping>
auto min_cycle_ratio(const Graph& gra,
T& r0,
Fn1&& get_cost,
Fn2&& get_time,
Mapping&& dist,
size_t max_iters = 1000)
minimum cost-to-time cycle ratio problem
| Template parameters | |
|---|---|
| Graph | |
| T | |
| Fn1 | |
| Fn2 | |
| Mapping | |
| Parameters | |
| gra in | |
| r0 in/out | |
| get_cost in | |
| get_time in | |
| dist in/out | |
| max_iters | |
| Returns | auto |
This function solves the following network parametric problem:
max r
s.t. dist[vtx] - dist[utx] \ge cost(utx, vtx) - r * time(utx, vtx)
\forall edge(utx, vtx) \in gra(V, E)