A generalized shortest path tour problem with time windows
type: Item
instance of: scholarly article
title: A generalized shortest path tour problem with time windows
zbMATH Open document ID: 1502.90181
author: Luigi Di Puglia Pugliese
author: Daniele Ferone
author: Paola Festa
author: Francesca Guerriero
published in: Computational Optimization and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7596184
zbMATH Keywords: generalized shortest path tour problem
zbMATH Keywords: disjoint subsets
zbMATH Keywords: time windows
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s10589-022-00405-8
OpenAlex ID: W4292565479
cites work: Some constrained shortest-route problems
cites work: Complexity analysis and optimization of the shortest path tour problem
cites work: Solving the shortest path tour problem
cites work: The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
cites work: The constrained shortest path tour problem
cites work: An efficient exact approach for the constrained shortest path tour problem
cites work: Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
cites work: Constrained shortest path tour problem: branch-and-price algorithm
cites work: Shortest path tour problem with time windows
cites work: Plus court chemin avec contraintes d'horaires
cites work: A survey of resource constrained shortest path problems: exact solution approaches
cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
cites work: A rollout algorithm for the resource constrained elementary shortest path problem
cites work: Q4395334
cites work: An efficient transformation of the generalized vehicle routing problem
cites work: Dimensionality reduction in multiobjective shortest path search
cites work: An improved multiobjective shortest path algorithm
cites work: A dynamic programming algorithm for solving the \(k\)-color shortest path problem
cites work: The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
cites work: Robust constrained shortest path problems under budgeted uncertainty
DOI: 10.1007/S10589-022-00405-8
description: scientific article; zbMATH DE number 7596184