2647 search results - page 31 / 530 » Solving Term Inequalities |
132
Voted
DISOPT
2008
15 years 3 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
126
Voted
JGO
2008
15 years 3 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
117
Voted
JSCIC
2007
15 years 3 months ago
2007
In this paper, we examine some computational issues on finite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid finite element ...
128
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
144
Voted
MP
1998
15 years 3 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...