3250 search results - page 302 / 650 » An Algorithm to Solve a Linear Program |
198
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
173
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
187
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
156
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
We consider two software packages that interact with each other as components: Overture and PETSc. An interface between these two packages could be of tremendous value to applicati...
174
click to vote
ENDM
2010
15 years 6 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...