Convexity and Steinitz's exchange property

DOI10.1007/3-540-61310-2_20zbMATH Open1415.90065OpenAlexW2107504654MaRDI QIDQ4645928FDOQ4645928

Authors: Kazuo Murota 

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_20

Recommendations

• Convexity and Steinitz's exchange property
• scientific article; zbMATH DE number 3897716
• scientific article; zbMATH DE number 3931746
• scientific article; zbMATH DE number 4052298
• Steffensen inequality, higher order convexity and exponential convexity
• Exponential convexity induced by Steffensen's inequality and positive measures
• Convexity properties of analytic complements in Stein spaces
• scientific article; zbMATH DE number 1799255
• Steinhaus-type property for the boundary of a convex body
• Steffensen type inequalities involving convex functions

zbMATH Keywords

bipartite graphsubmodular functionseparation theoremconcave functionintegral base

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Submodular functions and optimization
• A weighted matroid intersection algorithm
• Valuated matroids
• Convexity and Steinitz's exchange property
• Valuated matroids: A new look at the greedy algorithm
• Matroid valuation on independent sets
• Valuated Matroid Intersection I: Optimality Criteria
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• Finding optimal minors of valuated bimatroids
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• An Algorithm for Submodular Functions on Graphs
• Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Submodular flow problem with a nonseparable cost function
• Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
• Well-layered maps---a class of greedily optimizable set functions

Cited In (4)

• Optimization theory on antichains with the Steinitz exchange property
• Title not available (Why is that?)
• Discrete convex analysis
• Algorithmic aspects of private Bayesian persuasion

This page was built for publication: Convexity and Steinitz's exchange property

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