New formulations and solution procedures for the hop constrained network design problem. (Q1810496): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Primary and secondary route selection in backbone communication networks / 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: Heuristics, LPs, and Trees on Trees: Network Design Analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Hierarchical Survivable Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative improvement methods for a multiperiod network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone Network Design Tools with Economic Tradeoffs / 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: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet Routing in Telecommunication Networks with Path and Flow Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Link Capacity and Priority Assignments in Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in packet-switched communication networks with different criticality classes of communicating node pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primary and Secondary Route Selection in Backbone Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank

Latest revision as of 17:22, 5 June 2024

scientific article
Language Label Description Also known as
English
New formulations and solution procedures for the hop constrained network design problem.
scientific article

    Statements

    New formulations and solution procedures for the hop constrained network design problem. (English)
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    telecommunications
    0 references
    linear programming
    0 references
    heuristics
    0 references