Lifting of probabilistic cover inequalities

DOI10.1016/j.orl.2017.08.006zbMath1409.90123OpenAlexW2742759454MaRDI QIDQ1728321

Seulgi Joung, Sungsoo Park

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.08.006

zbMATH Keywords

liftingknapsack problemchance-constrained optimizationprobabilistic cover

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (2)

Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust optimization approach for a chance-constrained binary knapsack problem
• Exact solution of the robust knapsack problem
• Polymatroids and mean-risk minimization in discrete optimization
• A robust approach to the chance-constrained knapsack problem
• A PTAS for the chance-constrained knapsack problem with random item sizes
• The submodular knapsack polytope
• Chance-Constrained Programming
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• Chance-Constrained Binary Packing Problems
• Introduction to Stochastic Programming
• Easily Computable Facets of the Knapsack Polytope
• The Price of Robustness
• Facets of the Knapsack Polytope From Minimal Covers
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Allocating Bandwidth for Bursty Connections

This page was built for publication: Lifting of probabilistic cover inequalities