Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

DOI10.1287/IJOC.2022.1255OpenAlexW4287329229MaRDI QIDQ6121576

Katrin Heßler, Stefan Irnich

Publication date: 27 February 2024

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://econpapers.repec.org/RePEc:jgu:wpaper:2115

zbMATH Keywords

vehicle routingpackingpartial dominanceshortest-path problem with resource constraintsdynamic-programming labeling

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem