On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs

DOI10.1007/11496915_29zbMath1119.90068OpenAlexW4241372588MaRDI QIDQ3596336

Harold N. Gabow

Publication date: 30 August 2007

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

Full work available at URL: https://doi.org/10.1007/11496915_29

Mathematics Subject Classification ID

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

Related Items (3)

Approximation Algorithms for Multi-budgeted Network Design Problems ⋮ A Spectral Approach to Network Design ⋮ A unified algorithm for degree bounded survivable network design

This page was built for publication: On the L  ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs