📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (2014)

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1287/ijoc.2013.0555

Publication URI: http://dx.doi.org/10.1287/ijoc.2013.0555

Type: Journal Article/Review

Parent Publication: INFORMS Journal on Computing

Issue: 1