1182 search results - page 22 / 237 » Iterative Methods in Combinatorial Optimization |
166
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
109
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
110
click to vote
DAM
2006
14 years 11 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
Iterative optimization algorithms such as the forward-backward and Douglas-Rachford algorithms have recently gained much popularity since they provide efficient solutions to a wi...