The widestk-set of disjoint paths problem

DOI10.1051/RO/2022215OpenAlexW4313435997MaRDI QIDQ5880971FDOQ5880971

Authors: Marco A. Ribeiro, Iago A. Carvalho, Armando Honorio Pereira 

Publication date: 9 March 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022215

Recommendations

• On the disjoint paths problem
• The \(k\)-disjoint paths problem on chordal graphs
• scientific article
• On the complexity of the disjoint paths problem
• The maximum edge-disjoint paths problem in complete graphs
• The disjoint shortest paths problem
• The Induced Disjoint Paths Problem
• scientific article; zbMATH DE number 7561324
• Publication:3211338

zbMATH Keywords

heuristicsnetwork flowsinteger programmingdisjoint pathswidest paths

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Communication networks in operations research (90B18)

Cited In (1)

• Wide diameter and minimum length of disjoint Menger path systems

This page was built for publication: The widestk-set of disjoint paths problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880971)