A strongly polynomial algorithm for the minimum maximum flow degree problem

DOI10.1016/j.orl.2022.12.004zbMath1525.90088OpenAlexW4311255633MaRDI QIDQ6161285

Jhonata A. S. Matias, Manoel B. Campêlo

Publication date: 27 June 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.12.004

zbMATH Keywords

linear programmingnetwork flowflow coloring problemminimum maximum flow degree problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of the flow coloring problem
• On the complexity of bandwidth allocation in radio networks
• An application of simultaneous diophantine approximation in combinatorial optimization
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

This page was built for publication: A strongly polynomial algorithm for the minimum maximum flow degree problem