On the directed hop-constrained shortest path problem
type: Item
instance of: scholarly article
title: On the directed hop-constrained shortest path problem
zbMATH Open document ID: 1056.90116
DOI: 10.1016/S0167-6377(03)00026-9
author: Geir Dahl
author: Luis Gouveia
published in: Operations Research Letters
publication date: 2004-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2077339
zbMATH Keywords: Hop-constrained paths
zbMATH Keywords: Polyhedral characterizations
zbMATH Keywords: Valid inequalities
MaRDI profile type: Publication
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: Notes on polyhedra associated with hop-constrained paths
cites work: Q4509378
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Q4130999
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3818127
full work available at URL: s0167-6377(03)00026-9
OpenAlex ID: W2006877095
Recommended article: The Directed Disjoint Shortest Paths Problem
Recommended article: Efficient construction of directed hopsets and parallel approximate shortest paths
Recommended article: Fast approximation algorithms for routing problems with hop-wise constraints
Recommended article: Algorithms – ESA 2005
Recommended article: Q3985351
Recommended article: A complete characterization of jump inequalities for the hop-constrained shortest path problem
Recommended article: A note on the constrained shortest-path problem
Recommended article: On dynamic shortest paths problems
Recommended article: Algorithms – ESA 2004
Recommended article: On an exact method for the constrained shortest path problem
description: scientific article; zbMATH DE number 2077339