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 50 items.
- Extremal eigenproblem for bivalent matrices (Q1894469) (← links)
- Maximum cycle-means of weighted digraphs (Q1920444) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Linear matrix period in max-plus algebra (Q1973926) (← links)
- Graph Lyapunov function for switching stabilization and distributed computation (Q1987268) (← links)
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach (Q2039808) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
- The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory (Q2133400) (← links)
- Solving a constrained economic lot size problem by ranking efficient production policies (Q2165759) (← links)
- Analysis and control of max-plus linear discrete-event systems: an introduction (Q2177779) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- A strongly polynomial method for solving integer max-linear optimization problems in a generic case (Q2349847) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- The power algorithm in max algebra (Q2365659) (← links)
- A note on finding minimum mean cycle (Q2398498) (← links)
- Average-energy games (Q2413482) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions (Q2434294) (← links)
- Dwell time and average dwell time methods based on the cycle ratio of the switching graph (Q2439109) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- The robustness of interval matrices in max-plus algebra (Q2442283) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- Computing an eigenvector of a Monge matrix in max-plus algebra (Q2474561) (← links)
- Optimal infinite scheduling for multi-priced timed automata (Q2475633) (← links)
- Structure of the eigenspace of a Monge matrix in max-plus algebra (Q2476248) (← links)
- Permuted max-algebraic eigenvector problem is \(NP\)-complete (Q2479500) (← links)
- A method for approximating symmetrically reciprocal matrices by transitive matrices (Q2484490) (← links)
- Eigenvectors of interval matrices over max--plus algebra (Q2565846) (← links)
- \(\ell\)-parametric eigenproblem in max-algebra (Q2565847) (← 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)
- Cyclic schedules for r irregularity occurring events (Q2639766) (← links)
- \(p\)-dominant switched linear systems (Q2665658) (← links)
- Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
- Graph planning with expected finite horizon (Q2672939) (← links)
- Computing the average inter-sample time of event-triggered control using quantitative automata (Q2677100) (← links)
- Cooperative concurrent games (Q2680769) (← links)
- Uniform Expansivity Outside a Critical Neighborhood in the Quadratic Family (Q2802000) (← links)
- (Q2857726) (← links)
- Shortest Paths in Nearly Conservative Digraphs (Q2946022) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Graph-Based Dwell Time Computation Methods for Discrete-Time Switched Linear Systems (Q2960117) (← links)