Dynamic Programming for a Biobjective Search Problem in a Line

DOI10.1007/978-3-642-31770-5_31zbMath1358.90129OpenAlexW7944009MaRDI QIDQ3167376

Jochen Gorski, Mathias Jaschob, Luís Paquete, Kathrin Klamroth

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_31

zbMATH Keywords

dynamic programmingknapsack problemsmultiobjective combinatorial optimizationshortest path problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Dynamic programming multi-objective combinatorial optimization

This page was built for publication: Dynamic Programming for a Biobjective Search Problem in a Line