Pages that link to "Item:Q1249587"
From MaRDI portal
The following pages link to A characterization of the minimum cycle mean in a digraph (Q1249587):
Displayed 15 items.
- The directed orienteering problem (Q547309) (← links)
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times (Q617517) (← links)
- Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool (Q623763) (← links)
- On paths with the shortest average arc length in weighted graphs (Q686427) (← links)
- Cyclical games with prohibitions (Q689132) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (Q697566) (← links)
- On the performance evaluation of multi-guarded marked graphs with single-server semantics (Q708894) (← links)
- Minimum degree and density of binary sequences (Q709264) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones (Q794387) (← links)
- Applications of shortest path algorithms to matrix scalings (Q799343) (← links)
- The basic cyclic scheduling problem with deadlines (Q806665) (← links)
- Quantitative characterization of event streams in analysis of hard real-time applications (Q813133) (← links)
- Scheduling for stability in single-machine production systems (Q835553) (← links)