Pages that link to "Item:Q1417561"
From MaRDI portal
The following pages link to A greedy algorithm for some classes of integer programs. (Q1417561):
Displaying 10 items.
- An algorithm for a separable integer programming problem with cumulatively bounded variables (Q579126) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- A greedy algorithm for interval greedoids (Q1644861) (← links)
- A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
- On applicability of the algorithm of coordinate-wise lift for problems of integer programming (Q2713931) (← links)
- On the description of a class of integer programs resolvable by the coordinate lift algorithm (Q2773681) (← links)
- An analysis of six greedy selection rules on a class of zero-one integer programming models (Q3478264) (← links)
- A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254) (← links)
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality (Q3757688) (← links)
- (Q5263929) (← links)