1182 search results - page 1 / 237 » Iterative Methods in Combinatorial Optimization |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
AI
2006
Springer
13 years 4 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
AAAI
2010
13 years 6 months ago
2010
Using a model of agent behavior based around envy-reducing strategies, we describe an iterated combinatorial auction in which the allocation and prices converge to a solution in t...
MEMETIC
2010
12 years 11 months ago
2010
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...