Geodesic
A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
Yugoslav journal of operations research, Tome 21 (2011) no. 2, p. 187 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems; they are harder than the classical ones, and nowadays are intensively studied due to their interesting properties and applications in the real world. Because of the complexity of finding the optimal or near-optimal solution in case of the generalized combinatorial optimization problems, great effort has been made, by many researchers, to develop efficient ways of their transformation into classical corresponding variants. We present in this paper an efficient way of transforming the generalized vehicle routing problem into the vehicle routing problem, and a new integer programming formulation of the problem.
Classification : 90C27, 90C10, 68M10.
Keywords: Combinatorial optimization, efficient transformations, generalized combinatorial optimization problems, integer programming. 
@article{YJOR_2011_21_2_a2,
     author = {Petrica Pop and Corina Pop Sitar},
     title = {A {New} {Efficient} {Transformation} of the {Generalized} {Vehicle} {Routing} {Problem} into the {Classical} {Vehicle} {Routing} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {187 },
     publisher = {mathdoc},
     volume = {21},
     number = {2},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a2/}
}
TY  - JOUR
AU  - Petrica Pop
AU  - Corina Pop Sitar
TI  - A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
JO  - Yugoslav journal of operations research
PY  - 2011
SP  - 187 
VL  - 21
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a2/
LA  - en
ID  - YJOR_2011_21_2_a2
ER  - 
%0 Journal Article
%A Petrica Pop
%A Corina Pop Sitar
%T A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
%J Yugoslav journal of operations research
%D 2011
%P 187 
%V 21
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a2/
%G en
%F YJOR_2011_21_2_a2
Petrica Pop; Corina Pop Sitar. A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem. Yugoslav journal of operations research, Tome 21 (2011) no. 2, p. 187 . http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a2/