Document Type

Article

Publication Date

2015

Department

Mathematics & Statistics

Abstract

Classical approaches to multi-constrained routing problems generally require construction of trees and the use of heuristics to prevent combinatorial explosion. Introduced here is the notion of constrained path algebras and their application to multi-constrained path problems. The inherent combinatorial properties of these algebras make them useful for routing problems by implicitly pruning the underlying tree structures. Operator calculus (OC) methods are generalized to multiple non-additive constraints in order to develop algorithms for the multi constrained path problem and multi constrained optimization problem. Theoretical underpinnings are developed first, then algorithms are presented. These algorithms demonstrate the tremendous simplicity, flexibility and speed of the OC approach. Algorithms are implemented in Mathematica and Java and applied to a problem first proposed by Ben Slimane et al. as an example.

Comments

This article was originally accepted and published in the International Journal of Mathematics and Computer Science, Vol. 10, No. 1 (2015). http://ijmcs.future-in-tech.net/Volume10.1.html

Download

Share

COinS