A decomposition approach for optimal gas network extension with a finite set of demand scenarios
From MaRDI portal
Publication:1787320
DOI10.1007/s11081-017-9371-4zbMath1397.90085OpenAlexW2788050599MaRDI QIDQ1787320
Publication date: 5 October 2018
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-017-9371-4
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items
A generic optimization framework for resilient systems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the quantification of nomination feasibility in stationary gas networks with random load
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- SCIP: solving constraint integer programs
- Robust solutions of uncertain linear programs
- Dual decomposition in stochastic integer programming
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- A reduction technique for natural gas transmission network optimization problems
- Stochastic programming and the option of doing it differently
- On mathematical programming with indicator constraints
- Natural gas production network infrastructure development under uncertainty
- Generalized Benders decomposition
- Gas Network Extension Planning for Multiple Demand Scenarios
- Extending a CIP Framework to Solve MIQCPs
- Evaluating Gas Network Capacities
- Validation of nominations in gas network optimization: models, methods, and solutions
- Nonconvex Generalized Benders Decomposition
- Introduction to Stochastic Programming
- Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Optimization Models for the Natural Gas Value Chain
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
