A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time

DOI10.1007/978-3-319-89920-6_40zbMath1397.90423MaRDI QIDQ4685763

Frank Gurski, Carolin Rehs

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_40

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

05C85: Graph algorithms (graph-theoretic aspects)