Recoverable robust cardinality constrained maximization with commitment of a submodular function
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions
- A threshold of ln n for approximating set cover
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An analysis of approximations for maximizing submodular set functions—I
- Discrete Convex Analysis
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Recoverable robust shortest path problem under interval budgeted uncertainty representations
- Robust monotone submodular function maximization
- Robust recoverable perfect matchings
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- The concept of recoverable robustness, linear programming recovery, and railway applications
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Tight approximation algorithms for maximum general assignment problems
This page was built for publication: Recoverable robust cardinality constrained maximization with commitment of a submodular function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876378)
