Algorithms for the design of network topologies with balanced disjoint rings (Q2267818): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Üster, Halit / rank
Normal rank
 
Property / author
 
Property / author: Üster, Halit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SONET / 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.1007/s10732-008-9085-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068401401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient composite heuristic for the symmetric generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions to multi-depot location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:55, 2 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the design of network topologies with balanced disjoint rings
scientific article

    Statements

    Algorithms for the design of network topologies with balanced disjoint rings (English)
    0 references
    0 references
    0 references
    2 March 2010
    0 references
    network design
    0 references
    randomized algorithms
    0 references
    combined neighborhoods
    0 references
    disjoint rings
    0 references

    Identifiers