On the directed hop-constrained shortest path problem (Q1433652): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on polyhedra associated with hop-constrained paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 18:14, 6 June 2024

scientific article
Language Label Description Also known as
English
On the directed hop-constrained shortest path problem
scientific article

    Statements

    On the directed hop-constrained shortest path problem (English)
    0 references
    0 references
    0 references
    1 July 2004
    0 references
    0 references
    Hop-constrained paths
    0 references
    Polyhedral characterizations
    0 references
    Valid inequalities
    0 references