Sciweavers

MP
1998
109views more  MP 1998»
13 years 4 months ago
Rounding algorithms for covering problems
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
IJCAI
1993
13 years 5 months ago
An Analytic Learning System for Specializing Heuristics
This paper describes how meta-level theories are used for analytic learning in M U L T I - T A C . M U L T I - T A C operationalizes generic heuristics for constraint-satisfaction...
Steven Minton