A quadratic simplex algorithm for primal optimization over zero-one polytopes

A primal quadratic simplex algorithm tailored to the optimization over the vertices of a polytope is presented. Starting from a feasible vertex, it performs either strictly improving or admissible non-deteriorating steps in order to determine a locally optimum basic feasible solution in terms of the...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 347; s. 285 - 296
Hlavný autor:	Mallach, Sven
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.04.2024
Predmet:	Binary quadratic programming Linearly-constrained quadratic programming Simplex algorithm Simplex algorithm Linearly-constrained quadratic programming Binary quadratic programming
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!