The widestk-set of disjoint paths problem

DOI10.1051/RO/2022215MaRDI QIDQ5880971zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

disjoint pathsheuristicsinteger programmingnetwork flowswidest paths

Mathematics Subject Classification ID

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

Recommendations

• On the disjoint paths problem
• The \(k\)-disjoint paths problem on chordal graphs
• scientific article; zbMATH DE number 47435
• 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
• Shortest k-disjoint paths via determinants
• scientific article; zbMATH DE number 4191702

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)