A new branching rule for range minimization problems

DOI10.1007/978-3-031-59835-7_32MaRDI QIDQ7030542zbMATH OpenFDO

Authors Bart van Rossum, Rui Chen, Andrea Lodi

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-59835-7_32

zbMATH Keywords

branch-and-pricefairnessrange minimizationvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10)

Cites work

• An evolutionary algorithm for the vehicle routing problem with route balancing
• Branch-and-price: Column generation for solving huge integer programs
• New benchmark instances for the capacitated vehicle routing problem
• Optimizing fairness over time with homogeneous workers (short paper)
• Range minimization problems in path-facility location on trees
• Workload equity in vehicle routing: the impact of alternative workload resources

Cited in

(2)

• Efficient branching rules for optimizing range and order-based objective functions
• A generalized set partitioning model for MinMax vehicle routing

This page was built for publication: A new branching rule for range minimization problems

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