Generalized edge packings

DOI10.1007/BF01587091MaRDI QIDQ1825138zbMATH OpenOpenAlexFDO

Authors 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) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Odd path packings
• Node coverings with odd chains
• On the use of augmenting chains in chain packings
• Partitions into odd chains
• Chain packing in graphs
• Integer Programming and Combinatorial Optimization
• Graph packings
• Efficient subgraphs packing
• Matchings of cycles and paths in directed graphs
• Optimal packing of induced stars in a graph

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3325507 (Why is no real title available?)
• An Algorithm for a Minimum Cover of a Graph
• Odd path packings
• Partitions into odd chains
• The Factors of Graphs
• The Schrijver system of odd join polyhedra
• Variation on a theorem of König

Cited in

(3)

• Partitions into odd chains
• Node coverings with odd chains
• On the use of augmenting chains in chain packings

This page was built for publication: Generalized edge packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825138)