Supermodular covering knapsack polytope
From MaRDI portal
Publication:1751131
DOI10.1016/j.disopt.2015.07.003zbMath1387.90127MaRDI QIDQ1751131
Avinash Bhardwaj, Atamtürk, Alper
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.07.003
lifting; supermodularity; branch-and-cut algorithms; conic integer programming; probabilistic covering knapsack constraints
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Supermodularity and valid inequalities for quadratic optimization with indicators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing a class of submodular utility functions
- Lifting for conic mixed-integer programming
- Cover and pack inequalities for (mixed) integer programming
- Conic mixed-integer rounding cuts
- The submodular knapsack polytope
- On the facets of the mixed-integer knapsack polyhedron
- A note on maximizing a submodular set function subject to a knapsack constraint
- A semidefinite programming approach to the quadratic knapsack problem
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Robust solutions of linear programming problems contaminated with uncertain data
- The nonlinear knapsack problem - algorithms and applications
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Robust optimization-methodology and applications
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A nonlinear knapsack problem
- Submodular functions and optimization.
- Cuts for mixed 0-1 conic programming
- From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Primal-Dual Schema for Capacitated Covering Problems
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- An Algorithm for Nonlinear Knapsack Problems
- An analysis of approximations for maximizing submodular set functions—I
- Facets of the Knapsack Polytope From Minimal Covers
- Capacitated Facility Location: Valid Inequalities and Facets
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Submodular Function Minimization under Covering Constraints
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Two-Term Disjunctions on the Second-Order Cone
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
