Single source unsplittable flows with arc-wise lower and upper bounds

DOI10.1007/978-3-030-45771-6_23MaRDI QIDQ5041753zbMATH OpenOpenAlexFDO

Authors Sarah Morell, Martin Skutella

Publication date 14 October 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-45771-6_23

zbMATH Keywords

existence of an unsplittable flow, upper and lower bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Single source unsplittable flows with arc-wise lower and upper bounds
• On the single-source unsplittable flow problem
• Minimum-cost single-source 2-splittable flow
• Convex Combinations of Single Source Unsplittable Flows
• Flows on few paths: Algorithms and lower bounds

Cites work

• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for single-source unsplittable flow
• Convex Combinations of Single Source Unsplittable Flows
• Handbook of Approximation Algorithms and Metaheuristics
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Maximum \(k\)-splittable \(s, t\)-flows
• Minimum-cost single-source 2-splittable flow
• Network flow algorithms
• Network flows. Theory, algorithms, and applications.
• On the single-source unsplittable flow problem
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Single-source \(k\)-splittable min-cost flows
• The \(k\)-splittable flow problem

Cited in

(3)

• Single source unsplittable flows with arc-wise lower and upper bounds
• Bifactor approximation for location routing with vehicle and facility capacities
• Convex Combinations of Single Source Unsplittable Flows

This page was built for publication: Single source unsplittable flows with arc-wise lower and upper bounds

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