An integer programming algorithm for routing optimization in IP networks (Q547285): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9381-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248604969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internet Routing and Related Topology Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and Capacity Optimization for IP Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of unsplittable shortest path routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of OSPF Routing in IP Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid cycles: A source of infeasibility in open shortest path first routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the weight setting problem in OSPF routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing internet capacity using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Internet Protocol network design and routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting valid inequalities for the precedence constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting cover inequalities for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181425 / rank
 
Normal rank

Latest revision as of 05:41, 4 July 2024

scientific article
Language Label Description Also known as
English
An integer programming algorithm for routing optimization in IP networks
scientific article

    Statements

    An integer programming algorithm for routing optimization in IP networks (English)
    0 references
    0 references
    0 references
    1 July 2011
    0 references
    shortest path routing
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references

    Identifiers