@book{efd38f725cfc4b14a4534f7937744755,
title = "Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems",
abstract = "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 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.",
keywords = "non-additive objective, shortest path problem, dynamic programming, multi objective programming",
author = "Reinhardt, {Line Blander} and David Pisinger",
year = "2009",
language = "English",
isbn = "978-87-90855-61-1",
series = "DTU Management 2009",
number = "16",
publisher = "DTU Management",
}