Using separation algorithms in fixed dimension

DOI10.1016/0196-6774(92)90006-XzbMath0767.68061MaRDI QIDQ3990616

Carolyn Haibt Norton, Éva Tardos, Serge A. Plotkin

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

separationstrongly polynomial algorithmconcurrent multi-commodity flow problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Related Items (7)

An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ Generalized max flows and augmenting paths ⋮ Decomposable multi-parameter matroid optimization problems. ⋮ A fast polynomial time algorithm for logistics network flows ⋮ Weighted search in the plane ⋮ A combinatorial approximation algorithm for concurrent flow problem and its application ⋮ Optimization with additional variables and constraints

This page was built for publication: Using separation algorithms in fixed dimension