Best network flow bounds for the quadratic knapsack problem

Authors:
P. Chaillou;P. Hansen;Y. Mahieu
Affiliations:
-;-;-
Venue:
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Year:
1989

Citing 0
Cited 10

Upper bounds and exact algorithms for p-dispersion problems

Computers and Operations Research
The quadratic knapsack problem-a survey

Discrete Applied Mathematics
The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem

Informatica
Upper bounds and exact algorithms for p-dispersion problems

Computers and Operations Research
A genetic algorithm for the quadratic multiple knapsack problem

BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Optimizing query shortcuts in RDF databases

ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
The quadratic 0-1 knapsack problem with series-parallel support

Operations Research Letters
On reduction of duality gap in quadratic knapsack problems

Journal of Global Optimization
Quadratic bottleneck knapsack problems

Journal of Heuristics
Generalized quadratic multiple knapsack problem and two solution approaches

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract