Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity 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: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Algorithm for Multi-Level Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval estimation of a global optimum for large combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Confidence Limits for the Global Optimum in Combinatorial Optimization / rank
 
Normal rank

Latest revision as of 21:47, 3 June 2024

scientific article; zbMATH DE number 1704554
Language Label Description Also known as
English
Using a hybrid of exact and genetic algorithms to design survivable networks
scientific article; zbMATH DE number 1704554

    Statements

    Using a hybrid of exact and genetic algorithms to design survivable networks (English)
    0 references
    0 references
    0 references
    18 March 2003
    0 references
    networks
    0 references
    genetic algorithm
    0 references

    Identifiers