1182 search results - page 13 / 237 » Iterative Methods in Combinatorial Optimization |
FGCS
2000
14 years 11 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
WSCG
2000
15 years 29 days ago
2000
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
TIP
2008
14 years 11 months ago
2008
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...