scientific article; zbMATH DE number 3906513
From MaRDI portal
Publication:3684133
Recommendations
Cited in
(58)- Rooted \(k\)-connections in digraphs
- Pseudomatroids
- Generalized polymatroids and submodular flows
- An inequality for polymatroid functions and its applications.
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Base polyhedra and the linking property
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Coordinatewise domain scaling algorithm for M-convex function minimization
- On totally dual integral systems
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Discrete polymatroids
- A laminarity property of the polyhedron described by a weakly posi-modular set function
- Envy-free matchings with lower quotas
- Fair integral submodular flows
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- Proving total dual integrality with cross-free families—A general framework
- scientific article; zbMATH DE number 3862931 (Why is no real title available?)
- Adjacency on polymatroids
- On box totally dual integral polyhedra
- scientific article; zbMATH DE number 3970769 (Why is no real title available?)
- scientific article; zbMATH DE number 4008135 (Why is no real title available?)
- Supermodular and Tight Set Functions
- scientific article; zbMATH DE number 4075083 (Why is no real title available?)
- NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS
- scientific article; zbMATH DE number 1187952 (Why is no real title available?)
- scientific article; zbMATH DE number 8667 (Why is no real title available?)
- Characterizing and recognizing generalized polymatroids
- scientific article; zbMATH DE number 3558171 (Why is no real title available?)
- A NOTE ON THE DECOMPOSITION OF POLY-LINKING SYSTEMS AND THE MINORS OF GENERALIZED POLYMATROIDS
- Partial Intersection Theorem and Flows in Abstract Networks
- scientific article; zbMATH DE number 1263284 (Why is no real title available?)
- THE CRITICAL PROBLEM FOR POLYMATROIDS
- Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems
- scientific article; zbMATH DE number 1929933 (Why is no real title available?)
- Least Majorized Elements and Generalized Polymatroids
- On cardinality constrained polymatroids
- Market pricing for matroid rank valuations
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Polymatroidal flows with lower bounds
- Discrete convexity and equilibria in economies with indivisible goods and money
- Subdivisions of integral base polytopes
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- Intersection theory of polymatroids
- Matroid-rooted packing of arborescences
- Packing mixed hyperarborescences
- Matching with transfers under distributional constraints
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors
- A note on Frank's generalized polymatroids
- Monotonicity of polymatroids
- An intersection theorem for supermatroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684133)
