Robust combinatorial optimization with variable cost uncertainty
From MaRDI portal
(Redirected from Publication:296586)
Recommendations
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust combinatorial optimization with locally budgeted uncertainty
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
Cites work
- scientific article; zbMATH DE number 3257962 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- A robust approach to the chance-constrained knapsack problem
- Ambiguous chance constrained problems and robust optimization
- Cardinality constrained and multicriteria (multi)cut problems
- Complex Scheduling
- Dynamic Programming
- Exact solution of the robust knapsack problem
- Hop-level flow formulation for the survivable network design with hop constraints problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- On the robust knapsack problem
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust discrete optimization and network flows
- Robust network design: formulations, valid inequalities, and computations
- Shortest path algorithms: An evaluation using real road networks
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- The Price of Robustness
Cited in
(28)- Robust data envelopment analysis with variable budgeted uncertainty
- Robust combinatorial optimization with locally budgeted uncertainty
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- A note on robust 0-1 optimization with uncertain cost coefficients
- A dynamic programming approach for a class of robust optimization problems
- Combinatorial optimization under uncertainty
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Robust optimization for non-linear impact of data variation
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Optimization under Uncertainty via CometBoards
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust balanced optimization
- Robust network design with uncertain outsourcing cost
- Optimization under decision-dependent uncertainty
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Adjustable robust optimization through multi-parametric programming
- Minimizing the weighted sum of completion times under processing time uncertainty
- Robust scheduling with budgeted uncertainty
- Adjustable robustness for multi-attribute project portfolio selection
- Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach
- Bulk-robust combinatorial optimization
- Robust combinatorial optimization with knapsack uncertainty
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Lagrangean decomposition for mean-variance combinatorial optimization
- Robust combinatorial optimization with variable budgeted uncertainty
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
This page was built for publication: Robust combinatorial optimization with variable cost uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296586)
