K-submodular functions and convexity of their Lovász extension
From MaRDI portal
Publication:1613409
DOI10.1016/S0166-218X(01)00318-3zbMath1019.90036MaRDI QIDQ1613409
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A greedy algorithm for convex geometries, Dual greedy polyhedra, choice functions, and abstract convex geometries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular functions and optimization
- Geometric algorithms and combinatorial optimization
- On the core of ordered submodular cost games
- A note on Faigle and Kern's dual greedy polyhedra
- Submodular linear programs on forests
- Structural aspects of ordered polymatroids
- An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games