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...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 347; pp. 285 - 296
Main Author:	Mallach, Sven
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.04.2024
Subjects:	Binary quadratic programming Linearly-constrained quadratic programming Simplex algorithm Simplex algorithm Linearly-constrained quadratic programming Binary quadratic programming
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!