3433 search results - page 198 / 687 » Heuristics for a bidding problem |
154
click to vote
EOR
2010
15 years 6 months ago
2010
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
182
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
184
click to vote
FSTTCS
2004
Springer
16 years 2 hour ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
217
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
173
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...