Service level agreement (SLA) is a powerful tool to formalize the negotiation and agreement between the service provider and service seeker with the scope of service quality characteristics, compensations and tariffs. The service quality description is the main part of a SLA which can be characterized by the use of suitable and feasible quality of service (QoS) parameters. Determining suitable ...

1 Sección de Estudios de Posgrado e Investigación, ESIA Zacatenco, Instituto Politécnico Nacional, Avenida Instituto Politécnico Nacional s/n, Lindavista, Del. Gustavo A. Madero, 07320 México, DF, Mexico 2 Sección de Estudios de Posgrado e Investigación, ESIME Azcapotzalco, Instituto Politécnico Nacional, Avenida de las Granjas 682, Sta. Catarina, Del. Azcapotzalco, 02250 México, DF, Mexico 3 C...

We present a new greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron. The algorithm starts with a.n arbitrary feasible solution and a current feasible solution incrementally moves toward an optimal one in a greedy way. \Ve also show that there exists at least one optimal solution in the coordinate-wise steepest descent direction from a feasible s...

Feasibility pumps are highly effective primal heuristics for mixedinteger linear and nonlinear optimization. However, despite their success in practice there are only few works considering their theoretical properties. We show that feasibility pumps can be seen as alternating direction methods applied to special reformulations of the original problem, inheriting the convergence theory of these ...

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...