Pages that link to "Item:Q4834042"
From MaRDI portal
The following pages link to A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON (Q4834042):
Displaying 5 items.
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254) (← links)
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM (Q4331894) (← links)
- Characterizations of the set of integer points in an integral bisubmodular polyhedron (Q6197722) (← links)