Efficient branching rules for optimizing range and order-based objective functions

DOI10.1007/S10107-025-02306-0MaRDI QIDQ7239197zbMATH OpenFDO

Authors Bart van Rossum, Rui Chen, Andrea Lodi

Publication date 8 May 2026

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-025-02306-0

zbMATH Keywords

branch and pricefairnessgeneralized assignmentrange minimizationvehicle routing

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A fresh view on the discrete ordered median problem based on partial monotonicity
• A genetic algorithm for the generalised assignment problem
• A guide to formulating fairness in an optimization model
• A matheuristic for the MinMax capacitated open vehicle routing problem
• A new branching rule for range minimization problems
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Benders decomposition for the discrete ordered median problem
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Inequity averse optimization in operational research
• New benchmark instances for the capacitated vehicle routing problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Optimizing fairness over time with homogeneous workers (short paper)
• Range minimization problems in path-facility location on trees
• Solution of a min-max vehicle routing problem
• The m-Traveling Salesman Problem with Minmax Objective
• Workload equity in vehicle routing: the impact of alternative workload resources

This page was built for publication: Efficient branching rules for optimizing range and order-based objective functions

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