The traveling purchaser problem with time-dependent quantities
type: Item
instance of: scholarly article
title: The traveling purchaser problem with time-dependent quantities
zbMATH Open document ID: 1391.90502
author: Enrico Angelelli
author: Michel Gendreau
author: Renata Mansini
author: M. Vindigni
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901395
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: time-dependent quantity
zbMATH Keywords: branching strategy
describes a project that uses: CPLEX
describes a project that uses: MAXFLOW
MaRDI profile type: Publication
Wikidata QID: Q56476013
full work available at URL: j.cor.2017.01.001
OpenAlex ID: W2569893621
cites work: Exploring greedy criteria for the dynamic traveling purchaser problem
cites work: A stochastic programming approach for the traveling purchaser problem
cites work: The distance constrained multiple vehicle traveling purchaser problem
cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
cites work: Sequencing many jobs on a multi-purpose facility
cites work: A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Time-dependent routing problems: a review
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: Models for a traveling purchaser problem with additional side-constraints
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
cites work: Efficient modeling of travel in networks with time-varying link speeds
cites work: Vehicle dispatching with time-dependent travel times
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Projection results for vehicle routing
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: The traveling purchaser problem with budget constraint
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A heuristic approach for the travelling purchaser problem
cites work: Solving the asymmetric traveling purchaser problem
cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
cites work: A column generation approach for a school bus routing problem with resource constraints
cites work: Arc routing problems with time-dependent service costs
cites work: Q4715981
DBLP publication ID: journals/cor/AngelelliGMV17
DOI: 10.1016/J.COR.2017.01.001
description: scientific article; zbMATH DE number 6901395