A constructive algorithm for max-min paths problems on energy networks
From MaRDI portal
Recommendations
Cites work
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
- Controllability of a time-discrete dynamical system with the aid of the solution of an approximation problem
- scientific article; zbMATH DE number 59245 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
- Optimal paths in network games with \(p\) players
- Polynomial time algorithm for determining max-min paths in networks and solving zero value cyclic games
- Positional strategies for mean payoff games
- Simulation of \(\mathrm{CO}_2\) certificate trade and algorithmic optimisation of investments
- The complexity of mean payoff games on graphs
- Time dependency in multiple objective dynamic programming
This page was built for publication: A constructive algorithm for max-min paths problems on energy networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2518634)