Pages that link to "Item:Q3682254"
From MaRDI portal
The following pages link to A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254):
Displayed 3 items.
- Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector (Q4846556) (← links)