Dynamic programming for a biobjective search problem in a line

DOI10.1007/978-3-642-31770-5_31MaRDI QIDQ3167376zbMATH OpenOpenAlexFDO

Authors Luís Paquete, Mathias Jaschob, Jochen Gorski, 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)

Recommendations

• On a biobjective search problem in a line: formulations and algorithms
• Dynamic programming bi-criteria combinatorial optimization
• A hybrid dynamic programming approach to the biobjective binary knapsack problem
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Dynamic programming multi-objective combinatorial optimization

Cited in

(4)

• On a biobjective search problem in a line: formulations and algorithms
• Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation
• Dynamic programming bi-criteria combinatorial optimization
• Dynamic programming multi-objective combinatorial optimization

This page was built for publication: Dynamic programming for a biobjective search problem in a line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167376)