Solving the edge‐disjoint paths problem using a two‐stage method
From MaRDI portal
Publication:6066718
DOI10.1111/itor.12544OpenAlexW2800024708MaRDI QIDQ6066718
Unnamed Author, Abraham Duarte, Cesar Beltran-Royo, Ángel Sánchez
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12544
Related Items
On a relaxed maximally disjoint path pair problem: a bicriteria approach, Design of survivable wireless backhaul networks with reliability considerations, Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Heuristics for the bi-objective path dissimilarity problem
- The directed subgraph homeomorphism problem
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Escaping a grid by edge-disjoint paths
- A new implementation of Yen's ranking loopless paths algorithm
- Eulerian disjoint paths problem in grid graphs is NP-complete
- Graph minors. XIII: The disjoint paths problem
- NP-completeness of some edge-disjoint paths problems
- On the complexity of the disjoint paths problem
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- Multiobjective GRASP with path relinking
- The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
- Advanced Scatter Search for the Max-Cut Problem
- Emergence of Scaling in Random Networks
- Shortest node-disjoint paths on random graphs
- Handbook of Approximation Algorithms and Metaheuristics
- Information, Physics, and Computation
- Efficient algorithms for interval graphs and circular-arc graphs
- A Gentle Introduction to Memetic Algorithms
- Reducibility among Combinatorial Problems
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
