9810 search results - page 237 / 1962 » Problems, Descriptions and Objects |
163
click to vote
MOR
2007
15 years 5 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
197
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
150
click to vote
ESA
2007
Springer
15 years 12 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
168
click to vote
KES
2007
Springer
15 years 12 months ago
2007
Springer
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
157
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...