1566 search results - page 134 / 314 » On a Cone Covering Problem |
109
click to vote
EOR
2006
15 years 4 months ago
2006
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
139
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
154
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
140
Voted
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
132
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...