An Algebra for Network Routing Problems
From MaRDI portal
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)
Cited in
(52)- On visualization scaling, subeigenvectors and Kleene stars in max algebra
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- A condition for the strong regularity of matrices in the minimax algebra
- Large-scale network analysis with applications to transportation, communication and inference networks
- The parallel computation of minimum cost paths in graphs by stream contraction
- A decomposition algorithm for optimality problems in tree-structured networks
- Semirings and path spaces
- Duality and separation theorems in idempotent semimodules.
- Inclines and incline matrices: A survey.
- Universal numerical algorithms and their software implementation
- Applications of max-plus algebra to flow shop scheduling problems
- Tropical linear algebra with the Łukasiewicz t-norm
- Schulze voting as evidence carrying computation
- Fast and efficient solution of path algebra problems
- From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
- Bases in max-algebra
- Dijkstra, Floyd and Warshall meet Kleene
- (K,L)-eigenvectors in max-min algebra
- Complete solution of tropical vector inequalities using matrix sparsification.
- Semi-classical limit and least action principle revisited with \((\min,+)\) path integral and action-particle duality
- Dioïds and semirings: Links to fuzzy sets and other applications
- Algorithms for non-linear and stochastic resource constrained shortest path
- Steady state analysis of timed event graphs with time window constraints
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- Extremal properties of tropical eigenvalues and solutions to tropical optimization problems
- \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen
- Idempotent and tropical mathematics; complexity of algorithms and interval analysis
- Algebraic structures for dynamic networks
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- On tropical supereigenvectors
- Algebraic Methods Applied to Network Reliability Problems
- Parallel Algorithms for Network Routing Problems and Recurrences
- A comparison of gaussian and gauss-jordan elimination in regular algebra
- Projections in minimax algebra
- On a negative-equivalency theorem in associative optimal path problems
- A multidimensional tropical optimization problem with a non-linear objective function and linear constraints
- Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
- Max-algebraic attraction cones of nonnegative irreducible matrices
- The Whitney embedding theorem for tropical torsion modules. Classification of tropical modules
- \(P_{\max}^1\) and \(S_{\max}\) properties and asymptotic stability in the max algebra
- Factorization of tropical matrices
- Minimizing maximum lateness in two-stage projects by tropical optimization
- Nonlinear matrix decompositions and an application to parallel processing
- Morphological adjunctions represented by matrices in max-plus algebra for signal and image processing
- Time and sequence in networks of social interactions
- Models and methods of tropical algebra in problems of optimization and operations research
- On the number of iterations in the alternating method for integer matrices in max-algebra.
- A uniform synchronization problem over max-plus algebra
- Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes
- Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm
- Max-plus definite matrix closures and their eigenspaces
- Universal algorithms for solving the matrix Bellman equations over semirings
This page was built for publication: An Algebra for Network Routing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5624968)
