511 search results - page 19 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
CP
2003
Springer
15 years 2 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
74
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
123
click to vote
EMO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
ATMOS
2007
14 years 11 months ago
2007
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
100
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...