On a biobjective search problem in a line: formulations and algorithms

DOI10.1016/j.tcs.2013.02.016zbMath1302.90189OpenAlexW2059726532MaRDI QIDQ393048

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

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.016

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)

Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• Solving efficiently the 0-1 multi-objective knapsack problem
• Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Greedy algorithms for a class of knapsack problems with binary weights
• Dynamic programming in multiplicative lattices
• Vector-Valued Dynamic Programming
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Multicriteria Optimization

This page was built for publication: On a biobjective search problem in a line: formulations and algorithms