Pages that link to "Item:Q3682254"

The following pages link to A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254):

Displaying 10 items.

• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• A greedy algorithm for convex geometries (Q1410695) (← links)
• A greedy algorithm for some classes of integer programs. (Q1417561) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
• A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
• Note: An algorithm to solve polyhedral convex set optimization problems (Q2808332) (← links)
• The Partial Order of a Polymatroid Extreme Point (Q3696865) (← links)
• A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON (Q4834042) (← links)
• Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector (Q4846556) (← links)