Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
type: Item
instance of: scholarly article
title: Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
zbMATH Open document ID: 1346.90088
author: Marilène Cherkesly
author: Guy Desaulniers
author: Stefan Irnich
author: G. Laporte
published in: European Journal of Operational Research
publication date: 2016-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6636089
zbMATH Keywords: vehicle routing with pickups and deliveries
zbMATH Keywords: loading constraints
zbMATH Keywords: column generation
zbMATH Keywords: branch-price-and-cut
zbMATH Keywords: valid inequalities
MaRDI profile type: Publication
full work available at URL: j.ejor.2015.10.046
OpenAlex ID: W1848719272
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: An exact solution framework for a broad class of vehicle routing problems
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
cites work: Column Generation
cites work: Cutting planes for branch-and-price algorithms
cites work: Exact algorithms for the double vehicle routing problem with multiple stacks
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: An exact method for the double TSP with multiple stacks
cites work: Q4532225
cites work: Exact solutions to the double travelling salesman problem with multiple stacks
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
DOI: 10.1016/J.EJOR.2015.10.046
description: scientific article; zbMATH DE number 6636089