New Lagrangian Relaxation Approach for the Discrete Cost Multicommodity Network Design Problem

Nesrine Bakkar Ennaifer, Safa Bhar Layeb, Farah Mansour Zeghal

We aim to derive effective lower bounds for the Discrete Cost Multicommodity Network Design Problem (DCMNDP). Given an undirected graph, the problem requires installing at most one…