Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
search results - page 5 / 5
»
A Discrete Farkas Lemma
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
FOCS
2005
IEEE
140
views
Theoretical Computer Science
»
more
FOCS 2005
»
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
14 years 1 months ago
Download
www.mit.edu
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »