Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

Voted

MP
2010

79views more MP 2010»

MIP reformulations of the probabilistic set covering problem

15 years 1 months ago

MIP reformulations of the probabilistic set covering problem

Download edoc.hu-berlin.de

Anureet Saxena, Vineet Goyal, Miguel A. Lejeune

Real-time Traffic

MP 2010 |

claim paper

Related Content

» Consensus set maximization with guaranteed global optimality for robust geometry estimatio...

» New approaches to covering and packing problems

» Facets of the Complementarity Knapsack Polytope

» Context models on sequences of covers

» Three Kinds of Probabilistic Induction Universal Distributions and Convergence Theorems

» Mathematical programming approaches for generating pefficient points

» Automatic term mismatch diagnosis for selective query expansion

» Constraint Programming Based Column Generation for Employee Timetabling

» Speech Denoising and Dereverberation Using Probabilistic Models

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MP
Authors	Anureet Saxena, Vineet Goyal, Miguel A. Lejeune

Comments (0)