 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Bingane, C., & Mossinghoff, M. J. (2023). Small polygons with large area. Journal of Global Optimization, 16 pages. External link
Bingane, C., & Audet, C. (2022). The equilateral small octagon of maximal width. Mathematics of computation, 91(336), 2027-2040. External link
Bingane, C. (2022). Largest small polygons: a sequential convex optimization approach. Optimization Letters, 17(2), 385-397. External link
Bingane, C. (2022). Tight Bounds on the Maximal Area of Small Polygons: Improved Mossinghoff Polygons. Discrete & Computational Geometry, 70(1), 236-248. External link
Bingane, C. (2022). Tight bounds on the maximal perimeter and the maximal width of convex small polygons. Journal of Global Optimization, 84(4), 1033-1051. External link
Bingane, C., & Audet, C. (2022). Tight bounds on the maximal perimeter of convex equilateral small polygons. Archiv Der Mathematik, 119(3), 325-336. External link
Bingane, C., Anjos, M. F., & Le Digabel, S. (2021, July). CONICOPF: conic relaxations for AC optimal power flow computations [Paper]. IEEE Power and Energy Society General Meeting (PESGM 2021), Washington, D.C., USA (5 pages). External link
Bingane, C., Anjos, M. F., & Le Digabel, S. (2021, July). Tight-and-cheap conic relaxation for the optimal reactive power dispatch problem [Paper]. 2021 IEEE Power and Energy Society General Meeting (PESGM 2021), Washington, D.C., USA (1 page). External link
Bingane, C. (2019). Application de l'optimisation conique au problème d'écoulement de puissance optimal [Ph.D. thesis, Polytechnique Montréal]. Available
Bingane, C., Anjos, M. F., & Le Digabel, S. (2019, August). Tight-and-cheap conic relaxation for the AC optimal power flow problem [Abstract]. IEEE Power & Energy Society General Meeting (PESGM 2019), Atlanta, GA, USA. Published in 2019 IEEE Power & Energy Society General Meeting (PESGM). External link
Bingane, C., Anjos, M. F., & Le Digabel, S. (2019). Tight-and-Cheap Conic Relaxation for the Optimal Reactive Power Dispatch Problem. IEEE Transactions on Power Systems, 34(6), 4684-4693. External link
Bingane, C., Anjos, M. F., & Le Digabel, S. (2018). Tight-and-Cheap Conic Relaxation for the AC Optimal Power Flow Problem. IEEE Transactions on Power Systems, 33(6), 7181-7188. External link
