Generalized edge packings

DOI10.1007/BF01587091zbMath0683.90065OpenAlexW1976676026MaRDI QIDQ1825138

Dominique de Werra

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

undirected graphaugmenting chaingeneralized edge packingmaximum capacitated b-matchingmaximum odd chain packingnetwork flow techniquesnode coverings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

On the use of augmenting chains in chain packings

Cites Work

• Unnamed Item
• Unnamed Item
• Odd path packings
• Variation on a theorem of König
• The Schrijver system of odd join polyhedra
• An Algorithm for a Minimum Cover of a Graph
• Partitions into odd chains
• The Factors of Graphs

This page was built for publication: Generalized edge packings