Sciweavers

1542 search results - page 75 / 309
» Kernelization of packing problems
Sort
View
PRL
2008
133views more  PRL 2008»
14 years 11 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 6 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
NETWORKS
2006
14 years 11 months ago
Approximation algorithms for channel allocation problems in broadcast networks
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...
FOCS
2000
IEEE
15 years 3 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
EOR
2007
73views more  EOR 2007»
14 years 11 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...