A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
type: Item
instance of: scholarly article
title: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
zbMATH Open document ID: 1487.90623
author: Gonzalo Lera-Romero
author: Juan José Miranda-Bront
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7354503
zbMATH Keywords: traveling salesman
zbMATH Keywords: profitable tour problem
zbMATH Keywords: time-dependent travel times
zbMATH Keywords: integer programming
zbMATH Keywords: branch and cut
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.07.014
OpenAlex ID: W2962099521
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: A note on the separation of subtour elimination constraints in elementary shortest path problems
cites work: Solving elementary shortest-path problems as mixed-integer programs
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: Time-dependent routing problems: a review
cites work: Vehicle dispatching with time-dependent travel times
cites work: A branch-and-cut algorithm for the capacitated profitable tour problem
cites work: Facets and valid inequalities for the time-dependent travelling salesman problem
cites work: An integer programming approach for the time-dependent traveling salesman problem with time windows
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: The time-dependent capacitated profitable tour problem with time windows and precedence constraints
cites work: Integer programming formulations for the elementary shortest path problem
cites work: Vehicle Routing
cites work: A fast solution method for the time-dependent orienteering problem
cites work: The time-dependent orienteering problem with time windows: a fast ant colony system
cites work: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
Wikidata QID: Q127528511
DOI: 10.1016/J.EJOR.2019.07.014
Recommended article: A branch-and-cut algorithm for the capacitated profitable tour problem
Recommended article: The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Recommended article: A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Recommended article: A branch-and-cut algorithm for a resource-constrained scheduling problem
Recommended article: A branch-and-cut algorithm for the time window assignment vehicle routing problem
Recommended article: A branch-and-cut framework for the consistent traveling salesman problem
Recommended article: A new branch-and-price algorithm for the traveling tournament problem
Recommended article: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
description: scientific article; zbMATH DE number 7354503