2477 search results - page 16 / 496 » Approximate extended formulations |
CP
2003
Springer
14 years 21 days ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
13 years 9 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
SIAMIS
2011
13 years 2 months ago
2011
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...
AAMAS
2011
Springer
13 years 2 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
SIAMNUM
2010
13 years 2 months ago
2010
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...