Obserwuj
Marco Macchia
Tytuł
Cytowane przez
Cytowane przez
Rok
Extension complexity of stable set polytopes of bipartite graphs
M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
142017
Enumeration of 2-level polytopes
A Bohn, Y Faenza, S Fiorini, V Fisikopoulos, M Macchia, K Pashkovich
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
142015
Enumeration of 2-level polytopes
A Bohn, Y Faenza, S Fiorini, V Fisikopoulos, M Macchia, K Pashkovich
Mathematical Programming Computation 11 (1), 173-210, 2019
132019
Two-level polytopes with a prescribed facet
S Fiorini, V Fisikopoulos, M Macchia
International Symposium on Combinatorial Optimization, 285-296, 2016
92016
Two level polytopes: geometry and optimization
M Macchia
PhD thesis. Université libre de Bruxelles, 2018
62018
The biclique covering number of grids
K Guo, T Huynh, M Macchia
arXiv preprint arXiv:1811.03396, 2018
52018
Bounds on the number of 2-level polytopes, cones, and configurations
S Fiorini, M Macchia, K Pashkovich
Discrete & Computational Geometry 65, 587-600, 2021
32021
Recognizing Cartesian products of matrices and polytopes
M Aprile, M Conforti, Y Faenza, S Fiorini, T Huynh, M Macchia
Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021
32021
Lower bound computations for the nonnegative rank
S Fiorini, K Guo, M Macchia, M Walter
17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, 2019
32019
Slack matrices, k-products, and 2-level polytopes
M Aprile, M Conforti, S Fiorini, Y Faenza, T Huynh, M Macchia
Discrete Applied Mathematics, 2022
12022
Extension complexity of the correlation polytope
P Aboulker, S Fiorini, T Huynh, M Macchia, J Seif
Operations Research Letters 47 (1), 47-51, 2019
12019
Extension Complexity of the Correlation Polytope
P Aboulker, S Fiorini, T Huynh, M Macchia, J Seif
arXiv preprint arXiv:1806.00541, 2018
2018
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–12