16596 search results - page 376 / 3320 » Generalized Assignment Problems |
196
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
222
click to vote
COCOON
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
192
Voted
MP
2006
15 years 7 months ago
2006
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
174
click to vote
ORL
1998
15 years 7 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
250
Voted
DAM
2011
15 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...