Projections in minimax algebra

DOI10.1007/BF01580656zbMath0336.90062WikidataQ114852647 ScholiaQ114852647MaRDI QIDQ4103344

Raymond Cuninghame-Green

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Mathematical programming (90Cxx) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items

Algebraic solutions of tropical optimization problems ⋮ Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues ⋮ An improved algorithm for finding the generators of the solution space for \(A\otimes \mathbf{x}\ge \mathbf{x} \) ⋮ Generators, extremals and bases of max cones ⋮ Solution of a tropical optimization problem with linear constraints ⋮ Basic \(r\)-symmetric tropical polynomials ⋮ An algebraic expression of the number partitioning problem ⋮ Complete solution of tropical vector inequalities using matrix sparsification. ⋮ A note on the paper ‘Ultra discrete permanent and the consistency of max plus linear equations’ ⋮ Solution of a multidimensional tropical optimization problem using matrix sparsification ⋮ Cyclic projectors and separation theorems in idempotent convex geometry ⋮ A multidimensional tropical optimization problem with a non-linear objective function and linear constraints

Cites Work

• Unnamed Item
• A decomposition algorithm for optimality problems in tree-structured networks
• Remarque sur le polytope des couplages d'Edmonds
• Généralisation de l'algorithme de Warshall
• Sur l'algorithme matriciel de B. Roy
• An Algebra for Network Routing Problems
• Algorithms for Solving Production-Scheduling Problems
• A Note on an Algebra for the k Best Routes in a Network
• A Note on a Generalization of Boolean Matrix Theory