The quadratic knapsack problem—a survey

The binary quadratic knapsack problem maximizes a quadratic objective function subject to a linear capacity constraint. Due to its simple structure and challenging difficulty it has been studied intensively during the last two decades. The present paper gives a survey of upper bounds presented in th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete Applied Mathematics Ročník 155; číslo 5; s. 623 - 648
Hlavní autor:	Pisinger, David
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Lausanne Elsevier B.V 15.03.2007 Amsterdam Elsevier New York, NY
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithms Computer science; control theory; systems Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science Quadratic knapsack problem Semidefinite programming Theoretical computing Upper bounds Valid inequalities Approximation algorithms Semidefinite programming Valid inequalities Upper bounds Quadratic knapsack problem Polytope Lagrangian Computer theory Decomposition method Semi definite programming Approximation algorithm Experimental study Constrained optimization Knapsack problem Relaxation Upper bound Objective function Combinatorics Quadratic function
ISSN:	0166-218X, 1872-6771
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!