591 search results - page 46 / 119 » A constraint programming approach to cutset problems |
NETWORKS
2008
13 years 8 months ago
2008
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...
APJOR
2010
13 years 8 months ago
2010
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
JAIR
2008
13 years 8 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
AAAI
2007
13 years 10 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...