Unsplittable multicommodity flows in outerplanar graphs

DOI10.1007/978-3-031-93112-3_28MaRDI QIDQ6880120zbMATH OpenFDO

Authors David Alemán-Espinosa, Nikhil S Kumar

Publication date 22 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_28

zbMATH Keywords

multicommodity flowsplanar graphsunsplittable flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites work

• A note on the ring loading problem
• An approximation algorithm for the generalized assignment problem
• An improved upper bound for the Ring Loading Problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• Maximal Flow Through a Network
• Multicommodity flows in planar graphs
• On Odd Cuts and Plane Multicommodity Flows
• On the single-source unsplittable flow problem
• Small additive error for unsplittable multicommodity flow in outerplanar graphs
• The Ring Loading Problem

This page was built for publication: Unsplittable multicommodity flows in outerplanar graphs

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