Abstract
In this article we study the performance of multiobjective dynamic programming for a biobjective combinatorial optimization problem under several formulations. Based on our theoretical and computational results we argue that a clever definition of the recursion, allowing for strong dominance criteria, is crucial in the design of a multiobjective dynamic programming algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall (1993)
Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0-1 multi-objective knapsack problem. Computers & Operations Research 36(1), 260–276 (2009)
Brown, T., Strauch, R.: Dynamic programming in multiplicative lattices. Journal of Mathematical Analysis and Applications 12, 364–370 (1965)
Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125–136. Springer, Heidelberg (2009)
Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer (2005)
Gaver, D., Jacobs, P., Pilnick, S.: On minefield transit by detection, avoidance and demining. In: Bottoms, A., Scandrett, C. (eds.) Applications of Technology to Demining, an Anthology of Scientific Papers 1995-2005, Part 3 – Naval Mine Countermeasures, Society for Countermine Technology (2005)
Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making, Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 109–127. Springer (1980)
Henig, M.: Vector-value dynamic programming. SIAM Journal on Control and Optimization 21, 490–499 (1983)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer (2004)
Klamroth, K., Wiecek, M.: Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics 47(1), 57–76 (2000)
Sodhi, M., Swaszek, P., Bovio, E.: Stochastic line search using UUVs. In: 9th International Conference on Information Fusion (ICIF 2006), pp. 1–5 (2006)
Stone, L.: In search of AF flight 447. ORMS Today 38(4), 22–31 (2011)
Villarreal, B., Karwan, M.: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach. Mathematical Programming 21, 204–223 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paquete, L., Jaschob, M., Klamroth, K., Gorski, J. (2012). Dynamic Programming for a Biobjective Search Problem in a Line. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)