Centerpoints: A link between optimization and convex geometry
Basu A, Oertel T (2016)
Publication Type: Conference contribution
Publication year: 2016
Journal
Publisher: Springer Verlag
Book Volume: 9682
Pages Range: 14-25
Conference Proceedings Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Event location: Liege, BEL
ISBN: 9783319334608
DOI: 10.1007/978-3-319-33461-5_2
Abstract
We introduce a concept that generalizes several different notions of a “centerpoint” in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based on centerpoints are “best possible” in a certain sense. Motivated by this, we establish several structural results about this concept and provide efficient algorithms for computing these points.
Authors with CRIS profile
Involved external institutions
United Kingdom (GB)
United States (USA) (US)How to cite
APA:
Basu, A., & Oertel, T. (2016). Centerpoints: A link between optimization and convex geometry. In Martin Skutella, Quentin Louveaux (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 14-25). Liege, BEL: Springer Verlag.
MLA:
Basu, Amitabh, and Timm Oertel. "Centerpoints: A link between optimization and convex geometry." Proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, Liege, BEL Ed. Martin Skutella, Quentin Louveaux, Springer Verlag, 2016. 14-25.
BibTeX: Download