Minimum cost disjoint paths under arc dependences. Algorithms for practice.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Finding disjoint paths with different path-costs: Complexity and algorithms
Cited in
(5)- Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- scientific article; zbMATH DE number 7678024 (Why is no real title available?)
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
- An algorithm for minimum cost arc-connectivity orientations
This page was built for publication: Minimum cost disjoint paths under arc dependences. Algorithms for practice.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390349)
