Sciweavers

9 search results - page 1 / 2
» Robust Combinatorial Optimization with Exponential Scenarios
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 5 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 6 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
SEKE
2005
Springer
13 years 9 months ago
Application of Design Combinatorial Theory to Scenario-Based Software Architecture Analysis
Design combinatorial theory for test-case generation has been used successfully in the past. It is useful in optimizing test cases as it is practically impossible to exhaustively t...
Chung-Horng Lung, Marzia Zaman
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 6 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ICCV
2005
IEEE
13 years 10 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...