Sciweavers

13 search results - page 1 / 3
» Reformulation and sampling to solve a stochastic network int...
Sort
View
NETWORKS
2008
13 years 5 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CONEXT
2006
ACM
13 years 11 months ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...
ECAI
2010
Springer
13 years 6 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
CCE
2006
13 years 5 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 6 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen