A lexicographic search for strongly correlated 0-1 knapsack problems

MaRDI QIDQ690186zbMATH OpenFDO

Authors M. C. Fu

Publication date 10 January 1994

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

0-1 single constraint knapsack problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Cited in

(2)

• A fast algorithm for strongly correlated knapsack problems
• The travelling salesman problem with precedence constraints.

This page was built for publication: A lexicographic search for strongly correlated 0-1 knapsack problems

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