Skip to Main content Skip to Navigation
Journal articles

Operator Calculus Algorithms for Multi-Constrained Paths

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. Algorithmsare implemented inMathematica and Java and applied to a problem first proposed by Ben Slimane et al. as an example.
Document type :
Journal articles
Complete list of metadata
Contributor : Evangelia Tsiontsiou Connect in order to contact the contributor
Submitted on : Monday, December 14, 2015 - 11:12:19 AM
Last modification on : Saturday, October 16, 2021 - 11:26:08 AM


  • HAL Id : hal-01242868, version 1



Jamila Ben Slimane, Schott René, Yeqiong Song, George Stacey Staples, Evangelia Tsiontsiou, et al.. Operator Calculus Algorithms for Multi-Constrained Paths . International Journal of Mathematics and Computer Science, 2015, 10 (1). ⟨hal-01242868⟩



Record views