Supermodular covering knapsack polytope
type: Item
instance of: scholarly article
title: Supermodular covering knapsack polytope
zbMATH Open document ID: 1387.90127
author: Avinash Bhardwaj
author: Alper Atamtürk
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872063
zbMATH Keywords: conic integer programming
zbMATH Keywords: supermodularity
zbMATH Keywords: lifting
zbMATH Keywords: probabilistic covering knapsack constraints
zbMATH Keywords: branch-and-cut algorithms
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.07.003
OpenAlex ID: W2148870598
cites work: Capacitated Facility Location: Valid Inequalities and Facets
cites work: Maximizing a class of submodular utility functions
cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: Cover and pack inequalities for (mixed) integer programming
cites work: The submodular knapsack polytope
cites work: Conic mixed-integer rounding cuts
cites work: Lifting for conic mixed-integer programming
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Q3340498
cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Robust optimization-methodology and applications
cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach
cites work: From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: Primal-Dual Schema for Capacitated Covering Problems
cites work: Cuts for mixed 0-1 conic programming
cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
cites work: Q3988807
cites work: Submodular functions and optimization.
cites work: Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Facet of regular 0–1 polytopes
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: A nonlinear knapsack problem
cites work: Submodular Function Minimization under Covering Constraints
cites work: Q4821303
cites work: Two-Term Disjunctions on the Second-Order Cone
cites work: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
cites work: Q3993418
cites work: Split cuts and extended formulations for mixed integer conic quadratic programming
cites work: An Algorithm for Nonlinear Knapsack Problems
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A note on maximizing a submodular set function subject to a knapsack constraint
cites work: Faces for a linear inequality in 0–1 variables
DOI: 10.1016/J.DISOPT.2015.07.003
description: scientific article; zbMATH DE number 6872063