News

General constraints are relaxed by a nonlinear penalty function for which the corresponding dual problem has weak and strong duality. The relaxed problem is attacked by a genetic algorithm with ...
Ovidiu Cosma, Petrică C. Pop, Corina Pop Sitar, A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem, Carpathian Journal of Mathematics, Vol. 38, No. 1 (2022), pp ...