scientific article; zbMATH DE number 680242

Publication date: 31 October 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

vehicle routing time windows set partitioning material distribution resource assignment branch-and-price algorithm pickup and delivery problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (15)

A branch-and-price algorithm for a hierarchical crew scheduling problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ A branch-and-price algorithm for solving the cutting strips problem ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ New Refinements for the Solution of Vehicle Routing Problems with Branch and Price ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ An efficient column-generation-based algorithm for solving a pickup-and-delivery problem ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Ant colony system for a dynamic vehicle routing problem ⋮ On compact formulations for integer programs solved by column generation

This page was built for publication: