Pages that link to "Item:Q2773612"
From MaRDI portal
The following pages link to A greedy algorithm for maximizing a linear objective function (Q2773612):
Displaying 8 items.
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Two algorithms for a class of elliptic problems in shape optimization (Q1665068) (← links)
- New polyhedral and algorithmic results on greedoids (Q2220660) (← links)
- Problems on independence systems solvable by the greedy algorithm (Q3225892) (← links)
- Greedy Families for Linear Objective Functions (Q3970969) (← links)
- Algorithm for solving partially - linear optimization problems obtained by getting maximum of functions (Q4764588) (← links)
- Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials (Q5391475) (← links)