Characterization of facets of the hop constrained chain polytope via dynamic programming
type: Item
instance of: scholarly article
title: Characterization of facets of the hop constrained chain polytope via dynamic programming
zbMATH Open document ID: 1303.90117
author: Martin Grötschel
author: Rüdiger Stephan
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6344086
zbMATH Keywords: hop constraints
zbMATH Keywords: chains
zbMATH Keywords: dynamic programming
zbMATH Keywords: facets
MaRDI profile type: Publication
full work available at URL: j.dam.2013.08.015
OpenAlex ID: W2012203419
cites work: Projection, lifting and extended formulation integer and combinatorial optimization
cites work: A branch and cut approach to the cardinality constrained circuit problem.
cites work: On a routing problem
cites work: Compact vs. exponential-size LP relaxations
cites work: A note on hop-constrained walk polytopes.
cites work: On the directed hop-constrained shortest path problem
cites work: Q5294063
cites work: On the \(k\) edge-disjoint 2-hop-constrained paths polytope
cites work: Q4509378
cites work: On the facets and diameter of thek-cycle polytope
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Hop-constrained node survivable network design: An application to MPLS over WDM
cites work: Facets of the \(p\)-cycle polytope
cites work: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
cites work: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
cites work: On cardinality constrained cycle and path polytopes
cites work: Using separation algorithms to generate mixed integer model reformulations
cites work: Polyhedral Characterization of Discrete Dynamic Programming
cites work: On the Linear Description of the k-cycle Polytope
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Facets of the \((s,t)-p\)-path polytope
DOI: 10.1016/J.DAM.2013.08.015
description: scientific article; zbMATH DE number 6344086