Paths on polymatroids

DOI10.1007/BF01586058zbMath0764.90071MaRDI QIDQ1196722

Donald M. Topkis

Publication date: 16 January 1993

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

zbMATH Keywords

submodular functionadjacencypolymatroidadjacent polymatroid extreme pointsbounds on the length of certain strictly monotone paths

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Monotone diameter of bisubmodular polyhedra ⋮ On the Combinatorial Diameters of Parallel and Series Connections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On submodular function minimization
• The ellipsoid method and its consequences in combinatorial optimization
• Cores of convex games
• Adjacency on polymatroids
• The Partial Order of a Polymatroid Extreme Point
• The d-Step Conjecture and Its Relatives
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Activity selection games and the minimum‐cut problem
• Adjacency on Convex Polyhedra
• On the Tree Graph of a Matroid

This page was built for publication: Paths on polymatroids