Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm

DOI10.1002/net.1035zbMath0993.90074OpenAlexW2083864843MaRDI QIDQ4537605

John W. Mamer, Richard D. McBride

Publication date: 1 July 2002

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

simplex methodpiecewise linear optimizationundirected multicommodity flow

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Extreme-point and pivoting methods (90C49)

Related Items (5)

A novel approach to subgraph selection with multiple weights on arcs ⋮ Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A specialized network simplex algorithm for the constrained maximum flow problem

This page was built for publication: Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm