Generalized zeon algebras: theory and application to multi-constrained path problems

Classical approaches to routing problems often employ construction of trees and the use of heuristics to prevent combinatorial explosion. The algebraic approach presented herein, however, allows such explicit tree constructions to be avoided. Introduced here is the notion of generalized zeon algebras. Their inherent combinatorial properties make them useful for routing problems by implicitly pruning the underlying tree structures. Through the use of generalized idempotent algebras, max-min operators can be implemented for non-additive weights. Moreover, these algebras occur as subalgebras of Clifford algebras, lending them a natural connection to quantum probability and (by extension) to quantum computing.