Title of article
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems Original Research Article
Author/Authors
Walid Ben-Ameur، نويسنده , , José Neto، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
10
From page
1689
To page
1698
Abstract
Determining the cells of an arrangement of hyperplanes is a classical problem in combinatorial geometry. In this paper we present an efficient recursive procedure to solve it.
Keywords
Arrangements , Complexity , Unconstrained quadratic programming
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887718
Link To Document