The generalized minimum spanning tree polytope and related polytopes

The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each cluster. A different version of the problem, called E-GMST arises when exactly one node from each cluster has to be visited. Both GMST problem and E-GMST problem are NP-hard problems. In this paper, we model GMST problem and E-GMST problem as integer linear programs and study the facial structure of the corresponding polytopes

An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming

In linear programming it is known that an appropriate non-homogeneous Farkas Lemma leads to a short proof of the strong duality results for a pair of primal and dual programs. By using a corresponding generalized Farkas lemma we give a similar proof of the strong duality results for semidefinite programs under constraint qualifications. The proof includes optimality conditions. The same approach leads to corresponding results for linear semi-infinite programs. For completeness, the proofs for linear programs and the proofs of all auxiliary lemmata for the semidefinite case are included

The generalized minimum spanning tree problem

We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound procedure and an upper bound procedure and present the advantages of our approach in comparison with an earlier method. We present a solution procedure for solving GMST problem using cutting planes

An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size

Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster. It is known that the GMST problem is NP-hard and even finding a near optimal solution is NP-hard. We give an approximation algorithm for the Generalized Minimum Spanning Tree problem in the case when the cluster size is bounded by $\rho$. In this case, the GMST problem can be approximated to within 2$\rho$

Research trends in combinatorial optimization

Acknowledgments This work has been partially funded by the Spanish Ministry of Science, Innovation, and Universities through the project COGDRIVE (DPI2017-86915-C3-3-R). In this context, we would also like to thank the Karlsruhe Institute of Technology. Open access funding enabled and organized by Projekt DEAL.Peer reviewedPublisher PD

Centrality Dependence Of The Pseudorapidity Density Distribution For Charged Particles In Pb-pb Collisions At √snn=2.76tev

7264/Mai61062

Measurement of jet suppression in central Pb-Pb collisions at root s(NN)=2.76 TeV

The transverse momentum(p(T)) spectrum and nuclear modification factor (R-AA) of reconstructed jets in 0-10% and 10-30% central Pb-Pb collisions at root s(NN) = 2.76 TeV were measured. Jets were reconstructed using the anti-k(T) jet algorithm with a resolution parameter of R = 0.2 from charged and neutral particles, utilizing the ALICE tracking detectors and Electromagnetic Calorimeter (EMCal). The jet p(T) spectra are reported in the pseudorapidity interval of \eta(jet)\ 5 GeV/c to suppress jets constructed from the combinatorial background in Pb-Pb collisions. The leading charged particle requirement applied to jet spectra both in pp and Pb-Pb collisions had a negligible effect on the R-AA. The nuclear modification factor R-AA was found to be 0.28 +/- 0.04 in 0-10% and 0.35 +/- 0.04 in 10-30% collisions, independent of p(T), jet within the uncertainties of the measurement. The observed suppression is in fair agreement with expectations from two model calculations with different approaches to jet quenching. (C) 2015 CERN for the benefit of the ALICE Collaboration. Published by Elsevier B.V.Peer reviewe

Elliptic flow of identified hadrons in Pb-Pb collisions at 1asNN = 2.76 TeV

The elliptic flow coefficient (v2) of identified particles in Pb-Pb collisions at 1asNN = 2.76 TeV was measured with the ALICE detector at the Large Hadron Collider (LHC). The results were obtained with the Scalar Product method, a two-particle corre- lation technique, using a pseudo-rapidity gap of | 06\u3b7| > 0.9 between the identified hadron under study and the reference particles. The v2 is reported for \u3c0\ub1, K\ub1, K0S, p+p, \u3c6, \u39b+\u39b, \u39e 12+\u39e+ and \u3a9 12+\u3a9+ in several collision centralities. In the low transverse momentum (pT) region, pT 3 GeV/c

J/psi production as a function of charged-particle pseudorapidity density in p-Pb collisions at root s(NN)=5.02 TeV

We report measurements of the inclusive J/ψ yield and average transverse momentum as a function of charged-particle pseudorapidity density dNch/dη in p–Pb collisions at sNN=5.02TeV with ALICE at the LHC. The observables are normalised to their corresponding averages in non-single diffractive events. An increase of the normalised J/ψ yield with normalised dNch/dη, measured at mid-rapidity, is observed at mid-rapidity and backward rapidity. At forward rapidity, a saturation of the relative yield is observed for high charged-particle multiplicities. The normalised average transverse momentum at forward and backward rapidities increases with multiplicity at low multiplicities and saturates beyond moderate multiplicities. In addition, the forward-to-backward nuclear modification factor ratio is also reported, showing an increasing suppression of J/ψ production at forward rapidity with respect to backward rapidity for increasing charged-particle multiplicity