Branch-and-price

Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios

The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands

The capacitated vehicle routing problem with stochastic demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing problem where customer demands are random variables. While the most successful formulations for several …

Robust branch-and-cut-and-price for the Capacitated Minimum Spanning Tree Problem

Add the full text or supplementary notes for the publication here using Markdown formatting.

Robust branch-and-cut-and-price for the capacitated vehicle routing problem