Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems

DOI10.1287/OPRE.2023.2458MaRDI QIDQ6195060zbMATH OpenFDO

Authors Pedro Henrique P. V. Liguori, A. R. Mahjoub, Guillaume Marques, Ruslan Sadykov, Eduardo Uchoa

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2023.2458

zbMATH Keywords

cutting planescolumn generationlocation routing

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• Improved branch-cut-and-price for capacitated vehicle routing
• An exact method for the capacitated location-routing problem

Cited in

(3)

• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
• Resource-robust valid inequalities for vehicle routing and related problems
• Drone station location and routing optimization for infrastructure inspection

This page was built for publication: Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems

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