An algebraic framework for multi-objective and robust variants of path problems
From MaRDI portal
Recommendations
Cites work
- Composite path algebras for solving path problems in graphs.
- Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
- Deriving a class of layer-oriented graph algorithms
- Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
- scientific article; zbMATH DE number 1810469 (Why is no real title available?)
- scientific article; zbMATH DE number 4147534 (Why is no real title available?)
- scientific article; zbMATH DE number 3711960 (Why is no real title available?)
- scientific article; zbMATH DE number 1204366 (Why is no real title available?)
- scientific article; zbMATH DE number 1916666 (Why is no real title available?)
- Idempotent structures in optimization
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Multi-objective optimization problems. Concepts and self-adaptive parameters with mathematical and engineering applications
- Path problems in networks
- Regular algebra applied to language problems
- Robust discrete optimization and its applications
- Semirings and path spaces
- Solving multi-metric network problems: an interplay between idempotent semiring rules
- Theory and applications of robust optimization
Cited in
(4)- Generalized zeon algebras: theory and application to multi-constrained path problems
- scientific article; zbMATH DE number 1215002 (Why is no real title available?)
- Solving multi-metric network problems: an interplay between idempotent semiring rules
- scientific article; zbMATH DE number 2221029 (Why is no real title available?)
This page was built for publication: An algebraic framework for multi-objective and robust variants of path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297414)