Pages that link to "Item:Q4154386"
From MaRDI portal
The following pages link to Solving the Pipe Network Analysis Problem Using Optimization Techniques (Q4154386):
Displaying 30 items.
- Mathematical programming techniques in water network optimization (Q319201) (← links)
- Computing technical capacities in the European entry-exit gas market is NP-hard (Q827287) (← links)
- Convex reformulations for solving a nonlinear network design problem (Q902090) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) (← links)
- An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)
- On reworks in a serial process with flexible windows of time (Q2033394) (← links)
- Global optimization for the multilevel European gas market system with nonlinear flow models on trees (Q2114602) (← links)
- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches (Q2125366) (← links)
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market (Q2155380) (← links)
- Hydraulic modelling of closed pipes in loop equations of water distribution networks (Q2289987) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Existence of solution to a model for gas transportation networks on non-flat topography (Q2406507) (← links)
- On the complexity of instationary gas flows (Q2417151) (← links)
- Robust optimal discrete arc sizing for tree-shaped potential networks (Q2419569) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- Robustness to Time Discretization Errors in Water Network Optimization (Q2807011) (← links)
- Computational aspects of two-segment separable programming (Q3664835) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- (Q5317779) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
- Leak localization in drinking water distribution networks using structured residuals (Q5743811) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks (Q6087149) (← links)
