Buscar
Mostrando ítems 1-10 de 553
A polyhedral approach to the stability of a family of coalitions
(Elsevier Science, 2010-03)
Using polyhedral combinatorics and graph theory results, we study unstable families of coalitions and analyze the effect of adding players or deleting coalitions in order to obtain a stable family. We also generalize the ...
Stability results for polyhedral complementarity problems
(Elsevier, 2015)
Stability results for polyhedral complementarity problems
(Elsevier, 2015)
Dykstra’s algorithm with strategies for projecting onto certain polyhedral cones
(Elsevier Science Inc., 2005-08)
We consider Dykstra’s alternating projection method when it is used to find the projection onto polyhedral cones of the form {x Î H : á vi, xñ £ 0} where H is a real Hilbert space and á vi, vjñ > 0, i, j = 1, ..., n. Based ...
A polyhedral study of the maximum edge subgraph problem
(Elsevier Science, 2012-09)
The study of cohesive subgroups is an important aspect of social network analysis. Cohesive subgroups are studied using different relaxations of the notion of clique in a graph. For instance, given a graph and an integer ...
Polyhedral study of the maximum common induced subgraph problem
(Springer, 2016)
Euler's polyhedral formula
(Wolfram Demonstration Project, 2016)
Euler's polyhedral formula
(Wolfram Demonstration Project, 2011)
A Polyhedral-Based Approach Applied to Quadratic Cost Curves in the Unit Commitment Problem
(IEEE, 2016)
This paper presents a new polyhedral approximation for the quadratic cost curve of thermal units for the unit commitment problem. The approximation is tight, can be represented by rational numbers, and its size grows ...