Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem

•Polynomial-size formulations of the quadratic multiple knapsack problem from classical 0-1 quadratic programming reformulations.•New level-1 decomposable reformulation linearization techniques for the problem.•Comparison of LP, surrogate, and Lagrangian relaxations.•Theoretical properties and domin...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 291; číslo 3; s. 871 - 882
Hlavní autori:	Galli, Laura, Martello, Silvano, Rey, Carlos, Toth, Paolo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.06.2021
Predmet:	Binary quadratic programming Combinatorial optimization Lagrangian relaxation Quadratic multiple knapsack Reformulation linearization technique Binary quadratic programming Combinatorial optimization Quadratic multiple knapsack Lagrangian relaxation Reformulation linearization technique
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!