A characterization of network representable polymatroids

DOI10.1007/BF01417514MaRDI QIDQ5202490zbMATH OpenOpenAlexFDO

Authors Peter Brucker, Matthias F. M. Stallmann, Wolfgang W. Bein

Publication date 1991

Published in ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

grammoidsmultiple sink flow networkpolymatroidal function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1185602
• On a general framework for network representability in discrete optimization
• Polyhedral results for two-connected networks with bounded rings
• Characterization of graphs using domination polynomials
• Polyhedral Combinatorics and Network Reliability
• A characterization of the uncapacitated network design polytope
• Characterizing and recognizing generalized polymatroids
• scientific article; zbMATH DE number 1394808
• Properties of the metric polynom of Lagrange type on undirected networks
• A characterization of solvability for a class of networks

Cites work

• Computing Maximal “Polymatroidal” Network Flows
• scientific article; zbMATH DE number 3902670 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Minimum cuts, modular functions, and matroid polyhedra
• Optimal flows in networks with multiple sources and sinks
• Polymatroidal flow network models with multiple sinks
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling with Release Times, Deadlines, and Due Times

Cited in

(3)

• Réseaux et polynômes de dénombrement. (Networks and enumeration polynomials)
• Resource allocation via dynamic programming in activity networks
• scientific article; zbMATH DE number 1332111 (Why is no real title available?)

This page was built for publication: A characterization of network representable polymatroids

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