Randomized strategies for robust combinatorial optimization with approximate separation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A note on maximizing a submodular set function subject to a knapsack constraint
- Adaptive game playing using multiplicative weights
- Algorithmic Game Theory
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Approximation algorithms for knapsack problems with cardinality constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing knapsack solutions with cardinality robustness
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Polynomial algorithms in linear programming
- Randomized strategies for cardinality robustness in the knapsack problem
- Robust Matchings
- Robust independence systems
- Robust matchings and matroid intersections
- Robust monotone submodular function maximization
- Robust randomized matchings
- Security and Game Theory
- Submodular functions and optimization.
- Submodular maximization over multiple matroids via generalized exchange properties
- Two linear approximation algorithms for the subset-sum problem
This page was built for publication: Randomized strategies for robust combinatorial optimization with approximate separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182680)
