Sciweavers

14165 search results - page 175 / 2833
» The generalized two-server problem
Sort
View
140
Voted
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
15 years 8 months ago
Moving-Target TSP and Related Problems
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 ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
COCOON
2006
Springer
15 years 7 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
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...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
MP
2006
116views more  MP 2006»
15 years 4 months ago
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
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...
Hande Yaman
ORL
1998
130views more  ORL 1998»
15 years 3 months ago
Accelerating convergence in the Fermat-Weber location problem
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 ...
Jack Brimberg, Reuven Chen, Doron Chen
ICCS
2004
Springer
15 years 9 months ago
A Fast Multifrontal Solver for Non-linear Multi-physics Problems
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
Alberto Bertoldo, Mauro Bianco, Geppino Pucci