Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712459
DOI10.1007/b97946zbMath1093.05512OpenAlexW2484779063MaRDI QIDQ5712459
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Recent techniques and results on the Erdős-Pósa property ⋮ Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Rooted topological minors on four vertices ⋮ Packings and 2-packings of A-paths
This page was built for publication: Integer Programming and Combinatorial Optimization
