5331 search results - page 160 / 1067 » Algebraic Methods for Optimization Problems |
HICSS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
EVOW
2010
Springer
15 years 1 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
106
click to vote
IPCO
1993
14 years 11 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...