Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
From MaRDI portal
Publication:4846556
DOI10.1080/02522667.1995.10699207zbMath0830.90108OpenAlexW2050156281MaRDI QIDQ4846556
Publication date: 27 August 1995
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/101969
Cites Work
- Structural properties of greedoids
- A note on selectors and greedoids
- Homotopy properties of greedoids
- Homomorphisms and Ramsey properties of antimatroids
- Polymatroid greedoids
- Greedoids and Linear Objective Functions
- A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
- Submodular systems and related topics
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector