Branch-and-cut algorithm for multiband robust discrete optimization problems
From MaRDI portal
Cites work
- A new sequential lifting of robust cover inequalities
- A robust optimization approach to assess the effect of delays in the connection-to-the-grid time of new generation power plants over transmission expansion planning
- An analysis of approximations for maximizing submodular set functions—I
- Easily Computable Facets of the Knapsack Polytope
- Green design of wireless local area networks by multiband robust optimization
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- Introduction to stochastic programming.
- Lifting and separation of robust cover inequalities
- On the submodularity of the profit function in a problem of transport planning
- Polymatroids and mean-risk minimization in discrete optimization
- Recent advances in robust optimization: an overview
- Robust discrete optimization and network flows
- Robust optimization
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
- Robustness concepts for knapsack and network design problems under data uncertainty. Gamma-, multi-band, submodular, and recoverable robustness
- The multi-band robust knapsack problem -- a dynamic programming approach
- The Price of Robustness
- Theory and applications of robust optimization
This page was built for publication: Branch-and-cut algorithm for multiband robust discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289108)
