@incollection{,
    author = {Brieden, Andreas; Gritzmann, Peter},
    title = {On the inapproximability of polynomial programming, the geometry of stable sets, and the power of relaxation},
    editor = {Aronov, Boris; Basu, Saugata; Pach, Janos; Sharir, Micha},
    booktitle = {Discrete and Computational Geometry : The Goodman-Pollack Festschrift},
    series = {Discrete and Computational Geometry. Algorithms and Combinatorics},
    journal = {},
    address = {Berlin ; Heidelberg},
    publisher = {Springer},
    edition = {},
    year = {2003},
    isbn = {978-3-642-62442-1},
    volume = {25},
    number =  {},
    pages = {301-311},
    url = {},
    doi = {10.1007/978-3-642-55566-4_13},
    keywords = {},
    abstract = {The present paper introduces the geometric rank as a measure for the quality of relaxations of certain combinatorial optimization problems in the realm of polyhedral combinatorics. In particular, this notion establishes a tight relation between the maximum stable set problem from combinatorial optimization, polynomial programming from integer non linear programming and norm maximization, a basic problem from convex maximization and computational convexity.},
    note = {},
    institution = {Universität der Bundeswehr München, Fakultät für Wirtschafts- und Organisationswissenschaften, WOW 1 - Institut für Controlling, Finanz- und Risikomanagement, Professur: Brieden, Andreas},
    
    
}