Sciweavers

193 search results - page 1 / 39
» The Capacitated m-Ring-Star Problem
Sort
View
IOR
2007
67views more  IOR 2007»
13 years 5 months ago
The Capacitated m-Ring-Star Problem
Roberto Baldacci, Mauro Dell'Amico, J. Salazar Gon...
EOR
2000
102views more  EOR 2000»
13 years 5 months ago
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
Anita Amberg, Wolfgang Domschke, Stefan Voß
DAC
2000
ACM
14 years 6 months ago
Large-scale capacitance calculation
We describe a new method for accurate large-scale capacitance calculations. The algorithm uses an integral equation formulation, but with a new representation for charge distribut...
Sharad Kapur, David E. Long
AISS
2010
161views more  AISS 2010»
13 years 2 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
ASIAMS
2007
IEEE
13 years 11 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham