A lexicographic search for strongly correlated 0-1 knapsack problems
From MaRDI portal
Publication:690186
zbMath0791.90036MaRDI QIDQ690186
Publication date: 10 January 1994
Published in: Opsearch (Search for Journal in Brave)
Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
The travelling salesman problem with precedence constraints. ⋮ A fast algorithm for strongly correlated knapsack problems
This page was built for publication: A lexicographic search for strongly correlated 0-1 knapsack problems
