Adapting the \textit{ng}-path relaxation for bike balancing problems

DOI10.1016/j.orl.2022.02.005OpenAlexW4213320952MaRDI QIDQ2157885

Christian Tilk

Publication date: 22 July 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.02.005

zbMATH Keywords

branch-and-pricesplit-deliverybike balancingpath relaxationsplit-Pick-up

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Shared mobility systems: an updated survey
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Column Generation
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
• Unnamed Item
• Unnamed Item

This page was built for publication: Adapting the \textit{ng}-path relaxation for bike balancing problems