A decomposition approach for optimal gas network extension with a finite set of demand scenarios
From MaRDI portal
(Redirected from Publication:1787320)
Recommendations
- Gas network extension planning for multiple demand scenarios
- A mixed integer approach for time-dependent gas network optimization
- Optimization of capacity expansion planning for gas transportation networks
- A mixed integer model and an algorithm for steady-state gas network optimization
- A mixed integer approach for the transient case of gas network optimization.
- A simplified algorithm for optimization of large-scale gas networks
- Mixed integer models for the stationary case of gas network optimization
- scientific article; zbMATH DE number 2134200
- Deterministic global optimization approach to steady-state distribution gas pipeline networks
- Decomposable robust two-stage optimization: an application to gas network operations under uncertainty
Cites work
- A reduction technique for natural gas transmission network optimization problems
- Adjustable robust solutions of uncertain linear programs
- Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
- Dual decomposition in stochastic integer programming
- Evaluating Gas Network Capacities
- Extending a CIP framework to solve MIQCPs
- Gas network extension planning for multiple demand scenarios
- Generalized Benders decomposition
- Introduction to stochastic programming.
- Multi-stage stochastic programming for natural gas infrastructure design with a production perspective
- Natural gas production network infrastructure development under uncertainty
- Nonconvex Generalized Benders Decomposition
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- On mathematical programming with indicator constraints
- On the quantification of nomination feasibility in stationary gas networks with random load
- Optimization Models for the Natural Gas Value Chain
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust optimization
- Robust solutions of uncertain linear programs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Stochastic programming and the option of doing it differently
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Validation of nominations in gas network optimization: models, methods, and solutions
Cited in
(6)- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
- A system to evaluate gas network capacities: concepts and implementation
- An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry
- Optimization of capacity expansion planning for gas transportation networks
- Gas network extension planning for multiple demand scenarios
- A generic optimization framework for resilient systems
This page was built for publication: A decomposition approach for optimal gas network extension with a finite set of demand scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787320)
