An O(n) algorithm for quadratic knapsack problems

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Most cited references 1

Record: found
Abstract: not found
Article: not found

A polynomially bounded algorithm for a singly constrained quadratic program

J. Kennington, H Lall, R. Helgason (1980)

0 comments Cited 16 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Title: Operations Research Letters

Abbreviated Title: Operations Research Letters

Publisher: Elsevier BV

ISSN (Print): 01676377

Publication date Created: August 1984

Publication date (Print): August 1984

Volume: 3

Issue: 3

Pages: 163-166

Article

DOI: 10.1016/0167-6377(84)90010-5

SO-VID: 45e79874-bdda-470c-95ed-97989464fdd4

License:

http://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Comments

Comment on this article

scite_

Cited by 38

See all cited by

Most referenced authors 7

See all reference authors