A nonparametric robust optimization approach for chance-constrained knapsack problem

DOI10.1137/23M1620867MaRDI QIDQ6994530zbMATH OpenFDO

Authors Liang Xu, Chao Zhang, Zhou Xu, Daniel Zhuoyu Long

Publication date 23 April 2025

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1620867

zbMATH Keywords

chance constraintknapsack problemnonparametricrobust optimization

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A column generation approach to capacitated p-median problems
• A dynamic programming heuristic for the quadratic knapsack problem
• A note on the max-min 0-1 knapsack problem
• A polyhedral study of the cardinality constrained knapsack problem
• A PTAS for the chance-constrained knapsack problem with random item sizes
• A robust approach to the chance-constrained knapsack problem
• A Robust Optimization Perspective on Stochastic Programming
• Adjustable robust solutions of uncertain linear programs
• ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
• Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
• Approximation algorithms for knapsack problems with cardinality constraints
• Constraint programming based column generation for crew assignment
• Distributionally Robust Convex Optimization
• Distributionally robust discrete optimization with entropic Value-at-Risk
• Distributionally robust optimization and its tractable approximations
• Distributionally robust stochastic knapsack problem
• Entropic value-at-risk: a new coherent risk measure
• Estimation of probability densities by empirical density functions†
• Exact Solution of the Quadratic Knapsack Problem
• From CVaR to uncertainty set: implications in joint chance-constrained optimization
• Goal-driven optimization
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• On deterministic reformulations of distributionally robust joint chance constrained optimization problems
• On distributionally robust chance-constrained linear programs
• On the mixing set with a knapsack constraint
• On the robust knapsack problem
• On the solution of concave knapsack problems
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• Robust convex optimization
• Robust discrete optimization and network flows
• Robust integrated planning for LEO satellite network design and service operations
• Robust linear optimization under general norms.
• Robust optimization approach for a chance-constrained binary knapsack problem
• Robust solutions of linear programming problems contaminated with uncertain data
• Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
• Solution of large quadratic knapsack problems through aggressive reduction
• The distributionally robust chance-constrained vehicle routing problem
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The Price of Robustness
• The sample average approximation method for stochastic discrete optimization
• The second mean value theorem in the integral calculus.

This page was built for publication: A nonparametric robust optimization approach for chance-constrained knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994530)