511 search results - page 15 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
AAAI
2010
14 years 11 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...
MANSCI
2008
14 years 9 months ago
2008
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
COR
2008
14 years 9 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...