Pages that link to "Item:Q1278287"
From MaRDI portal
The following pages link to Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287):
Displaying 12 items.
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- Algorithms – ESA 2005 (Q5475891) (← links)
