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

DOI10.1287/IJOC.2022.1255MaRDI QIDQ6121576zbMATH OpenOpenAlexFDO

Authors 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

packingvehicle routingpartial dominanceshortest-path problem with resource constraintsdynamic-programming labeling

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
• A branch-and-cut algorithm for vehicle routing problems
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
• Vehicle routing with compartments: applications, modelling and heuristics
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes

Cited in

(1)

• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121576)