16504 search results - page 103 / 3301 » New Problems, New Solutions |
159
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
220
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
159
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
161
click to vote
Publication
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
179
click to vote
CP
2003
Springer
15 years 11 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...