840 search results - page 70 / 168 » Inapproximability of Combinatorial Optimization Problems |
75
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
105
click to vote
JMLR
2006
15 years 11 days ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
115
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
118
Voted
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
ALGORITHMICA
2006
15 years 15 days ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...