Theoretical and algorithmic results for a class of hierarchical fleet mix problems

DOI10.1016/j.ejor.2008.09.043zbMath1176.90412OpenAlexW2043940552MaRDI QIDQ1042052

Rossana Riccardi, Riccardo Cambini

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.043

zbMATH Keywords

discrete convexitydiscrete programmingoptimal fleet mix

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Unnamed Item
• Mixed integer programming to schedule a single-shift workforce under annualized hours
• The fleet size and mix vehicle routing problem
• An algorithm for single shift scheduling of hierarchical workforce
• Discrete convex analysis
• Single-shift off-day scheduling of a hierarchical workforce with variable demands
• Optimization on low rank nonconvex structures
• Discrete convexity: Convexity for functions defined on discrete spaces
• Integer programming to schedule a hierarchical workforce with variable demands
• An integer programming model for hierarchical workforce scheduling problem
• The fleet size and mix vehicle routing problem with time windows
• Vehicle Fleet Composition
• Dynamic Optimization of Vehicle Fleet Size
• New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

This page was built for publication: Theoretical and algorithmic results for a class of hierarchical fleet mix problems