discrete optimization problems

40

MP
1998

109views more MP 1998»

Rounding algorithms for covering problems

13 years 10 months ago

In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...

Dimitris Bertsimas, Rakesh V. Vohra

claim paper

Read More »

32

click to vote

HEURISTICS
2002

122views more HEURISTICS 2002»

Complete Local Search with Memory

13 years 10 months ago

Download som.eldoc.ub.rug.nl

Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...

Diptesh Ghosh, Gerard Sierksma

claim paper

Read More »

29

click to vote

ORL
2008

93views more ORL 2008»

Polymatroids and mean-risk minimization in discrete optimization

13 years 10 months ago

Download www.ieor.berkeley.edu

We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...

Alper Atamtürk, Vishnu Narayanan

claim paper

Read More »

29

click to vote

IPCO
1996

89views Optimization» more IPCO 1996»

On Dependent Randomized Rounding Algorithms

14 years 6 days ago

Download web.mit.edu

In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...

Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers