Results 191 to 200 of about 5,749 (206)

The quadratic multiple knapsack problem and three heuristic approaches to it

Proceedings of the 8th annual conference on Genetic and evolutionary computation, 2006
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a time with objects whose contributions are likely to be large relative to their weights. A hill-climber and a genetic algorithm encode candidate solutions as strings over {0,1,...,
Amanda Hiley, Bryant A. Julstrom
openaire   +1 more source

A strongly polynomial FPTAS for the symmetric quadratic knapsack problem

European Journal of Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Heuristics to Convex Quadratic Knapsack Problems in Sorted ADP

2006
Approximate dynamic programming (ADP) was developed for solving large-scale optimization problems, and function approximation is an important method in the dynamic programming scheme. Continuous quadratic programming relaxation (CQPR) and the integral parts of the solutions to CQPR are two intuitionistic heuristics as function approximations in ADP for
Bin Zhang 0006, Zhongsheng Hua
openaire   +1 more source

Approximating the Quadratic Knapsack Problem on Special Graph Classes

2014
We study the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are present only for certain pairs of knapsack items. These pairs are represented by the edges of a graph G=(V,E) whose vertices represent the knapsack items. We show that QKP permits an FPTAS on graphs of bounded
Ulrich Pferschy, Joachim Schauer
openaire   +1 more source

A logarithmic descent direction algorithm for the quadratic knapsack problem

Applied Mathematics and Computation, 2020
Zhengtian Wu, Baoping Jiang, Hamid Reza Karimi   +2 more
exaly  

Generalized quadratic multiple knapsack problem and two solution approaches

Computers and Operations Research, 2014
Tugba SaraC, Aydin Sipahioglu
exaly  

A new upper bound for the 0-1 quadratic knapsack problem

European Journal of Operational Research, 1999
Alain Billionnet
exaly  

A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem

Computers and Operations Research, 2017
Mustafa Avci
exaly  

An effective GRASP and tabu search for the 0–1 quadratic knapsack problem

Computers and Operations Research, 2013
Feng Chu, Zhen Yang
exaly  

A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem

Operations Research Letters, 1988
Kamlesh Mathur
exaly