A variable neighbourhood search combining constraint programming and Lagrangean relaxation for solving routing problems

v1

Type:Conference Paper

0 views

[![NobleID](https://www.nobleid.org/api/badge/CB7CAD93.svg?ark=w1%2F20260515%2FCB7CAD93)](https://nobleid.org/work/w1/20260515/CB7CAD93)

ARK Inflections

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors