An Inexact Quadratic Simplex Algorithm Tailored to Zero-One Polyhedra

Mallach, Sven (2021) An Inexact Quadratic Simplex Algorithm Tailored to Zero-One Polyhedra.
Technical Report , 9 p.

Abstract

A simplex algorithm is presented that is tailored to quadratic optimization over the vertices of zero-one polyhedra. While the algorithm can guarantee only local optima in general, computational experiments show a good performance on standard benchmark libraries.


Actions:
Download: [img] PDF - Preprinted Version
Download (419kB)
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: UNSPECIFIED
Depositing User: Sven Mallach
Date Deposited: 04 Mar 2021 14:01
Last Modified: 05 Mar 2021 11:17
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/951