A robust optimization approach to flow decomposition
From MaRDI portal
Cites work
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A survey of adjustable robust optimization
- A survey on robustness in railway planning
- Adjustable robust solutions of uncertain linear programs
- Characterizations for optimality conditions of general robust optimization problems
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Data-driven robust optimization using deep neural networks
- Generalized light robustness and the trade-off between robustness and nominal quality
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Line planning in public transportation: models and methods
- Minimal-cost network flow problems with variable lower bounds on arc flows
- Network design with vulnerability constraints and probabilistic edge reliability
- Nominal and robust train timetabling problems
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Operations Research in passenger railway transportation
- Optimization algorithms for resilient path selection in networks
- Railway track allocation: Models and methods
- Recent advances in robust optimization: an overview
- Robust convex optimization
- Robust optimization
- Robust optimization - a comprehensive survey
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Benders decomposition algorithm: a literature review
- The Price of Robustness
- Theory and applications of robust optimization
This page was built for publication: A robust optimization approach to flow decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263431)
