Analysis of a class of graph partitioning problems
P. Bertolazzi, M. Lucertini, A. Marchetti Spaccamela (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
P. Bertolazzi, M. Lucertini, A. Marchetti Spaccamela (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
G. Georgakopoulos, A. Stafylopatis (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)
Qüestiió
Similarity:
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads...
Pierre Hansen, Martine Labbé, Jacques-François Thisse (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Rossella Petreschi, Bruno Simeone (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
V. Th. Paschos (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: