Valid cycles: A source of infeasibility in open shortest path first routing (Q3548721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
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.1002/net.20232 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4239300522 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115150496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internet Routing and Related Topology Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extremal structure of an OSPF related cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problems of matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Internet Protocol network design and routing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:59, 28 June 2024

scientific article
Language Label Description Also known as
English
Valid cycles: A source of infeasibility in open shortest path first routing
scientific article

    Statements

    Valid cycles: A source of infeasibility in open shortest path first routing (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2008
    0 references
    telecommunication networks
    0 references
    Internet Protocol
    0 references
    OSPF
    0 references
    routing
    0 references
    compatible weights
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references