Pages that link to "Item:Q4950970"
From MaRDI portal
The following pages link to The Data-Correcting Algorithm for the Minimization of Supermodular Functions (Q4950970):
Displaying 10 items.
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- A combinatorial approach to level of repair analysis (Q1840842) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Finite-Time Analysis for the Knowledge-Gradient Policy (Q4610155) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
