Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Introduction to algorithms
Efficient Algorithms for Path Problems with Gernal Cost Citeria
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Operations Research: An Introduction (8th Edition)
Operations Research: An Introduction (8th Edition)
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Extended dominance and a stochastic shortest path problem
Computers and Operations Research
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Operations Research
Finding all attractive train connections by multi-criteria Pareto search
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Computers and Operations Research
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
On an exact method for the constrained shortest path problem
Computers and Operations Research
Resource constrained shortest paths with a super additive objective function
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A genetic algorithm for finding a path subject to two constraints
Applied Soft Computing
| Hi-index | 0.01 |
Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths.