Using a hybrid of exact and genetic algorithms to design survivable networks
From MaRDI portal
Publication:5955471
DOI10.1016/S0305-0548(00)00059-9zbMath1020.90009MaRDI QIDQ5955471
Ronald L. Rardin, Elham Ghashghai
Publication date: 18 March 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (3)
Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Constraint ordinal optimization ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum-weight two-connected spanning networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- The Steiner tree polytope and related polyhedra
- On simple characterizations of k-trees
- Steiner trees, partial 2–trees, and minimum IFI networks
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A characterization of partial 3-trees
- Using Confidence Limits for the Global Optimum in Combinatorial Optimization
- Characterization and Recognition of Partial 3-Trees
- Complexity of Finding Embeddings in a k-Tree
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
- The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs
- Interval estimation of a global optimum for large combinatorial problems
- A Dual-Based Algorithm for Multi-Level Network Design
- Genetic Algorithms and Random Keys for Sequencing and Optimization
This page was built for publication: Using a hybrid of exact and genetic algorithms to design survivable networks
