|
Volumn 207, Issue 3, 2010, Pages 1227-1234
|
A heuristic procedure for the Capacitated m-Ring-Star problem
|
Author keywords
Capacitated m Ring Star problem; Heuristic algorithms; Networks
|
Indexed keywords
CAPACITATED M-RING-STAR PROBLEM;
COMMUNICATION NETWORKS;
COMPUTATIONAL EXPERIMENT;
COMPUTING TIME;
CONSTRUCTION PHASE;
HEURISTIC PROCEDURES;
INPUT PARAMETER;
LOCAL OPTIMA;
LOCAL SEARCH;
NETWORKS;
NODE-DISJOINT;
NP-HARD;
NUMBER OF ITERATIONS;
OPTIMAL SOLUTIONS;
COMMUNICATION;
CUSTOMER SATISFACTION;
HEURISTIC METHODS;
SALES;
TRAVELING SALESMAN PROBLEM;
HEURISTIC ALGORITHMS;
|
EID: 77957707984
PISSN: 03772217
EISSN: None
Source Type: Journal
DOI: 10.1016/j.ejor.2010.06.030 Document Type: Article |
Times cited : (32)
|
References (10)
|