Sciweavers

14739 search results - page 200 / 2948
» An optimization problem on the sphere
Sort
View
EOR
2007
70views more  EOR 2007»
14 years 11 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
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...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
103
Voted
WWW
2008
ACM
15 years 11 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
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 ...
Yunhong Zhou, Victor Naroditskiy
84
Voted
EMMCVPR
2009
Springer
15 years 5 months ago
General Search Algorithms for Energy Minimization Problems
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...
Dmitrij Schlesinger
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 5 months ago
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
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...
Francisco Luna, Christian Blum, Enrique Alba, Anto...
PPAM
2007
Springer
15 years 5 months ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
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). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...