14739 search results - page 200 / 2948 » An optimization problem on the sphere |
171
click to vote
EOR
2007
15 years 7 months ago
2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
212
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
175
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
172
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evalu...
209
click to vote
PPAM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...