A decomposition approach for optimal gas network extension with a finite set of demand scenarios
type: Item
instance of: scholarly article
title: A decomposition approach for optimal gas network extension with a finite set of demand scenarios
zbMATH Open document ID: 1397.90085
author: Jonas Schweiger
author: F. Liers
published in: Optimization and Engineering
publication date: 2018-10-05T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6947460
zbMATH Keywords: decomposition
zbMATH Keywords: robust
zbMATH Keywords: gas network extension
zbMATH Keywords: MINLP
describes a project that uses: SCIP
describes a project that uses: GasLib
MaRDI profile type: Publication
full work available at URL: s11081-017-9371-4
OpenAlex ID: W2788050599
cites work: SCIP: solving constraint integer programs
cites work: Robust solutions of uncertain linear programs
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Q3182207
cites work: Extending a CIP Framework to Solve MIQCPs
cites work: Robust discrete optimization and network flows
cites work: Introduction to Stochastic Programming
cites work: On mathematical programming with indicator constraints
cites work: Dual decomposition in stochastic integer programming
cites work: Solving the Pipe Network Analysis Problem Using Optimization Techniques
cites work: Generalized Benders decomposition
cites work: On the quantification of nomination feasibility in stationary gas networks with random load
cites work: Q5416130
cites work: Evaluating Gas Network Capacities
cites work: Robust discrete optimization and its applications
cites work: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
cites work: Nonconvex Generalized Benders Decomposition
cites work: Natural gas production network infrastructure development under uncertainty
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Validation of nominations in gas network optimization: models, methods, and solutions
cites work: A reduction technique for natural gas transmission network optimization problems
cites work: Gas Network Extension Planning for Multiple Demand Scenarios
cites work: Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Optimization Models for the Natural Gas Value Chain
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
cites work: Stochastic programming and the option of doing it differently
DOI: 10.1007/S11081-017-9371-4
Recommended article: Gas Network Extension Planning for Multiple Demand Scenarios
Recommended article: A mixed integer approach for time-dependent gas network optimization
Recommended article: Optimization of capacity expansion planning for gas transportation networks
Recommended article: Q3132647
Recommended article: Q5757148
Recommended article: A simplified algorithm for optimization of large-scale gas networks
Recommended article: Mixed integer models for the stationary case of gas network optimization
Recommended article: Q3159363
Recommended article: Deterministic global optimization approach to steady-state distribution gas pipeline networks
Recommended article: Decomposable robust two‐stage optimization: An application to gas network operations under uncertainty
description: scientific article; zbMATH DE number 6947460