Integrality in the multinetwork min‐cost equal‐flow problem

DOI10.1002/net.22094zbMath1528.90056OpenAlexW4220794926MaRDI QIDQ6064158

Unnamed Author, Refael Hassin

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22094

zbMATH Keywords

computational complexityintegral solutionsmin-cost flowequal-flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Robust transshipment problem under consistent flow constraints

Cites Work

• Integer equal flows
• Minimum cost flow algorithms for series-parallel networks
• On greedy algorithms for series parallel graphs
• The equal flow problem
• Series parallel composition of greedy linear programming problem
• An algorithm to solve the proportional network flow problem
• Robust minimum cost flow problem under consistent flow constraints
• Algorithms for the Simple Equal Flow Problem
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• An efficient lagrangean relaxation scheme for linear and integer equal flow problems
• Minimum-cost dynamic flows: The series-parallel case
• Unnamed Item
• Unnamed Item

This page was built for publication: Integrality in the multinetwork min‐cost equal‐flow problem