A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems

Research output: Contribution to conference › Paper › peer-review

Original language	English
Pages	105-108
Number of pages	4
Publication status	Published - 1 Jan 2009
Event	8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009 - Paris, France Duration: 2 Jun 2009 → 4 Jun 2009

Conference	8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009
Country/Territory	France
City	Paris
Period	2/06/09 → 4/06/09

Keywords

@conference{288bb8a693e74522828623efd114801a,

title = "A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems",

keywords = "Arrangements, Complexity, Unconstrained quadratic programming",

author = "Walid Ben-Ameur and Jos{\'e} Neto",

year = "2009",

month = jan,

day = "1",

language = "English",

pages = "105--108",

note = "8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009 ; Conference date: 02-06-2009 Through 04-06-2009",

}

TY - CONF

T1 - A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems

AU - Ben-Ameur, Walid

AU - Neto, José

PY - 2009/1/1

Y1 - 2009/1/1

KW - Arrangements

KW - Complexity

KW - Unconstrained quadratic programming

M3 - Paper

AN - SCOPUS:85084351436

SP - 105

EP - 108

T2 - 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009

Y2 - 2 June 2009 through 4 June 2009

ER -