In: Mathematical Programming, 2015, vol. 149, no. 1-2, p. 361-390
|
In: European Journal of Combinatorics, 2020, vol. 87, p. 103098
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik (2010).In this paper we consider a hyperplane arrangement associated to every split pseudometric and, for tree-like metrics, we study the combinatorics of its underlying matroid.- We give explicit formulas for the face numbers of fundamental polytopes and ...
|
Thèse de doctorat : Università della Svizzera italiana, 2020 ; 2020ECO004.
This thesis contributes to labour economics by considering a wide range of factors influencing career paths, transitions to self- employment and duration in entrepreneurship. In the past literature, several studies have analysed labour market outcomes, transitions and durations. Nevertheless, there is the need of knowing more about the influence of individual and background characteristics on...
|
In: Foundations of Computational Mathematics, 2014, vol. 14, no. 2, p. 299-337
|
In: Mathematical Programming, 2014, vol. 146, no. 1-2, p. 525-554
|
In: Finance and Stochastics, 2014, vol. 18, no. 2, p. 327-347
|
In: Journal of Global Optimization, 2014, vol. 60, no. 2, p. 217-238
|
In: Probability Theory and Related Fields, 2014, vol. 160, no. 1-2, p. 391-427
|
In: Advances in Geometry, 2019, vol. 19, no. 1, p. 89–100
It is known that there exist hyperplane arrangements with the same underlying matroid that admit non-homotopy equivalent complement manifolds. Here we show that, in any rank, complex central hyperplane arrangements with up to 7 hyperplanes and the same underlying matroid are isotopic. In particular, the diffeomorphism type of the complement manifold and the Milnor fiber and fibration of these...
|
Thèse de doctorat : Università della Svizzera italiana, 2018 ; 2018INFO011.
The field of logistics and combinatorial optimization features a wealth of NP-hard problems that are of great practical importance. For this reason it is important that we have efficient algorithms to provide optimal or near-optimal solutions. In this work, we study, compare and develop Sampling-Based Metaheuristics and Exact Methods for logistic problems that are important for their...
|