The following pages link to The submodular knapsack polytope (Q1040079):
Displayed 19 items.
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
- Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty (Q2806955) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information (Q4687246) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)