Pages that link to "Item:Q4717566"
From MaRDI portal
The following pages link to Valuated Matroid Intersection I: Optimality Criteria (Q4717566):
Displaying 32 items.
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids (Q1293131) (← links)
- Note on exchange axioms for valuated matroids and valuated delta-matroids (Q1375629) (← links)
- A constructive proof for the induction of M-convex functions through networks (Q1383387) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Randomized algorithms for finding the shortest negative cost cycle in networks (Q1693163) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Two algorithms for valuated \(\Delta\)-matroids (Q1921193) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- Convexity and Steinitz's exchange property (Q4645928) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- Matroidal Choice Functions (Q5234660) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- On circuit valuation of matroids (Q5933469) (← links)
- Efficient matching under general constraints (Q6565039) (← links)
