A note on hop-constrained walk polytopes.
type: Item
instance of: scholarly article
title: A note on hop-constrained walk polytopes.
zbMATH Open document ID: 1052.05033
author: Geir Dahl
author: Njål Foldnes
author: Luis Gouveia
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 2125892
zbMATH Keywords: Complete description
zbMATH Keywords: Hop-constraints
zbMATH Keywords: Walk
zbMATH Keywords: Extended formulation
MaRDI profile type: Publication
full work available at URL: j.orl.2003.10.008
OpenAlex ID: W2049236593
cites work: The perfectly matchable subgraph polytope of a bipartite graph
cites work: Notes on polyhedra associated with hop-constrained paths
cites work: On the directed hop-constrained shortest path problem
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
DOI: 10.1016/J.ORL.2003.10.008
description: scientific article; zbMATH DE number 2125892