The following pages link to (Q5593809):
Displaying 11 items.
- The cost-to-time ratio problem for large or infinite graphs (Q1101357) (← links)
- Minimum cost-reliability ratio path problem (Q1102209) (← links)
- Weighted min cost flows (Q1168883) (← links)
- A characterization of the minimum cycle mean in a digraph (Q1249587) (← links)
- Numerical analysis of generalised max-plus eigenvalue problems. (Q1427218) (← links)
- Periodic network optimization with different arc frequencies (Q1923597) (← links)
- Status of periodic optimization of dynamical systems (Q2561769) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues (Q2639765) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory (Q5097012) (← links)