The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determineâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Michel Vasquez, Yannick Vimont
- European Journal of Operational Research
- 2005

Geometric Constraint and Cutting planes have been successfully used to solve the 0â€“1 multidimensional knapsack problem. Ourâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Brian C. Dean, Michel X. Goemans, Jan VondrÃ¡k
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes areâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Hugues Marchand, Laurence A. Wolsey
- Math. Program.
- 1999

Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existingâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- P. C. Chu, John E. Beasley
- J. Heuristics
- 1998

In this paper we present a heuristic based upon genetic algorithms for the multidimensional knapsack problem. A heuristicâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Sami Khuri, Thomas BÃ¤ck, JÃ¶rg HeitkÃ¶tter
- SAC
- 1994

A genetic algorithm, GENEsYs, is applied to an NP-complele problem, the 0/1 multiple knapsack problem. The partitioning of theâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- References, Milind Dawande, +12 authors A H G Rinnooy Kan
- 1993

item in the big bin and obtains a profit of 1 while OPT = 2. This also shows that ordering bins in non-increasing capacities doesâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Keith W. Ross, Danny H. K. Tsang
- IEEE Trans. Communications
- 1989

Considered is a knapsack with integer volume Fand which is capable of holding K different classes of objects. An object fromâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Oscar H. Ibarra, Chul E. Kim
- J. ACM
- 1975

Given a positive integer M and n pairs of positive integers (p~, cD, , (p. , c.), maximize the s u m ~ ~p~ subject to the cons tâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Sartaj Sahni
- J. ACM
- 1975

A serms of increasingly accurate algorithms to obtain approximate solutions to the 0/1 one-dlmensmnal knapsack problem :sâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- Ellis Horowitz, Sartaj Sahni
- J. ACM
- 1974

Given <italic>r</italic> numbers <italic>s</italic><subscrpt>1</subscrpt>, Â·Â·Â·, <italic>s<subscrpt>r</subscrpt></italicâ€¦Â (More)

Is this relevant?