An exact algorithm for linear integer programming problems with distributionally robust chance constraints
From MaRDI portal
Publication:2698584
DOI10.3934/jimo.2022230OpenAlexW4313195970MaRDI QIDQ2698584
Publication date: 24 April 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022230
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and search algorithm for a class of nonlinear knapsack problems
- Exact algorithm for concave knapsack problems: linear underestimation and partition method
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Robust solutions of uncertain linear programs
- Second-order cone programming
- The nonlinear knapsack problem - algorithms and applications
- Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
- A nonlinear knapsack problem
- Distributionally robust joint chance constraints with second-order moment information
- A note on adapting methods for continuous global optimization to the discrete case
- On distributionally robust chance-constrained linear programs
- Ambiguous chance constrained problems and robust optimization
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Nonlinear integer programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Robust Convex Optimization
- Chance-Constrained Programming
- Algorithms for Separable Nonlinear Resource Allocation Problems
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Distributionally Robust Stochastic Knapsack Problem
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- A Soft Robust Model for Optimization Under Ambiguity
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- The Price of Robustness
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- A Survey of Methods for Pure Nonlinear Integer Programming
- Branch-and-Bound Strategies for Dynamic Programming
- An Algorithm for Nonlinear Knapsack Problems
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
- The Nonlinear Resource Allocation Problem
- A new exact algorithm for concave knapsack problems with integer variables
- Chance Constrained Programming with Joint Constraints
- Distributionally robust chance constraints for non-linear uncertainties
